Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Undecidability of CA classification schemes
Complex Systems
Time/space trade-offs for reversible computation
SIAM Journal on Computing
Classifying circular cellular automata
Physica D
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 degrees
Theoretical Computer Science
The Mathematica Book
The complexity of reversible cellular automata
Theoretical Computer Science - Special issue: Theoretical aspects of cellular automata
Logical reversibility of computation
IBM Journal of Research and Development
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
Decidability and Universality in Symbolic Dynamical Systems
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
| Hi-index | 0.00 |
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's “Principle of Computational Equivalence”. We discuss a classification for cellular automata that is based on computably enumerable degrees. In this setting the full structure of the semilattice of the c.e. degrees is inherited by the cellular automata.