Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Undecidability of CA classification schemes
Complex Systems
Classifying circular cellular automata
Physica D
The Mathematica book (4th edition)
The Mathematica book (4th edition)
On the classifiability of cellular automata
Theoretical Computer Science
A new kind of science
Cellular automata and intermediate reachability problems
Fundamenta Informaticae - Special issue on cellular automata
Cellular automata and intermediate reachability problems
Fundamenta Informaticae - Special issue on cellular automata
Almost periodic configurations on linear cellular automata
Fundamenta Informaticae - Special issue on cellular automata
The complexity of reversible cellular automata
Theoretical Computer Science - Special issue: Theoretical aspects of cellular automata
Decidability and Universality in Symbolic Dynamical Systems
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
On the complex behavior of simple tag systems-An experimental approach
Theoretical Computer Science
Computational processes, observers and Turing incompleteness
Theoretical Computer Science
Cellular Automata, Decidability and Phasespace
Fundamenta Informaticae - Non-Classical Models of Automata and Applications
Bulking II: Classifications of cellular automata
Theoretical Computer Science
On the complexity of limit sets of cellular automata associated with probability measures
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Universality and cellular automata
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Decidability and Universality in Symbolic Dynamical Systems
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Almost Periodic Configurations on Linear Cellular Automata
Fundamenta Informaticae - Cellular Automata
Cellular Automata and Intermediate Reachability Problems
Fundamenta Informaticae - Cellular Automata
On the Undecidability of Attractor Properties for Cellular Automata
Fundamenta Informaticae - From Physics to Computer Science: to Gianpiero Cattaneo for his 70th birthday
| Hi-index | 5.23 |
We study a classification of cellular automata based on the Turing degree of the orbits of the automaton. The difficulty of determining the membership of a cellular automaton in any one of these classes is characterized in the arithmetical hierarchy.