4 search results - page 1 / 1 » Cellular Automata and Intermediate Reachability Problems |
FUIN
2002
13 years 4 months ago
2002
Abstract. We exhibit one-dimensional cellular automata whose reachability and confluence problems have arbitrary r.e. degree of unsolvability.
ACRI
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Cellular Automata are a powerful formal model for describing physical and computational processes. Qualitative analysis of Cellular Automata is in general a hard problem....
MCU
2004
13 years 6 months ago
2004
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...
ICS
2010
Tsinghua U.
14 years 2 months ago
2010
Tsinghua U.
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 ...