A full computation-relevant topological dynamics classification of elementary cellular automata

From MaRDI portal
Publication:2944652




Abstract: Cellular automata are both computational and dynamical systems. We give a complete classification of the dynamic behaviour of elementary cellular automata (ECA) in terms of fundamental dynamic system notions such as sensitivity and chaoticity. The "complex" ECA emerge to be sensitive, but not chaotic and not eventually weakly periodic. Based on this classification, we conjecture that elementary cellular automata capable of carrying out complex computations, such as needed for Turing-universality, are at the "edge of chaos".




Cited in
(28)






This page was built for publication: A full computation-relevant topological dynamics classification of elementary cellular automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2944652)