500 search results - page 3 / 100 » Universality and Cellular Automata |
TCS
2011
13 years 1 months ago
2011
This paper presents a 1D intrinsically universal cellular automaton with four states for a first neighbors neighborhood, improving on the previous lower bound and getting nearer ...
STACS
1997
Springer
13 years 11 months ago
1997
Springer
Abstract. This paper deals with simulation and reversibility in the context of Cellular Automata (ca). We recall the de nitions of ca and of the Block (bca) and Partitioned (pca) s...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
The study of factoring relations between subshifts or cellular automata is central in symbolic dynamics. Besides, a notion of intrinsic universality for cellular automata based on ...
TCS
2011
13 years 1 months ago
2011
Let F be a cellular automaton (CA). This paper establishes necessary conditions for F in order to be intrinsically universal. The central idea is to consider the communication com...
MCU
2004
13 years 8 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...