Sciweavers

78 search results - page 3 / 16
» Infinite Time Cellular Automata: A Real Computation Model
Sort
View
STACS
2005
Springer
13 years 11 months ago
Cellular Automata: Real-Time Equivalence Between One-Dimensional Neighborhoods
Abstract. It is well known that one-dimensional cellular automata working on the usual neighborhood are Turing complete, and many acceleration theorems are known. However very litt...
Victor Poupet
GEOINFORMATICA
2006
86views more  GEOINFORMATICA 2006»
13 years 6 months ago
Decreasing Computational Time of Urban Cellular Automata Through Model Portability
This paper investigates how portability of a model between different computer operating systems can lead to increased efficiency in code execution. The portability problem is not a...
Charles Dietzel, Keith C. Clarke
ICS
2010
Tsinghua U.
14 years 3 months ago
Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A ...
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz
RTSS
2003
IEEE
13 years 11 months ago
Timed I/O Automata: A Mathematical Framework for Modeling and Analyzing Real-Time Systems
We describe the Timed Input/Output Automata (TIOA) framework, a general mathematical framework for modeling and analyzing real-time systems. It is based on timed I/O automata, whi...
Dilsun Kirli Kaynar, Nancy A. Lynch, Roberto Segal...
ECCC
2000
75views more  ECCC 2000»
13 years 5 months ago
Deterministic Turing Machines in the Range between Real-Time and Linear-Time
Deterministic k-tape and multitape Turing machines with one-way, two-way and without a separated input tape are considered. We investigate the classes of languages acceptable by s...
Andreas Klein, Martin Kutrib