A computation-universal two-dimensional 8-state triangular reversible cellular automaton
From MaRDI portal
Publication:1575918
DOI10.1016/S0304-3975(99)00099-7zbMath0951.68086MaRDI QIDQ1575918
Kenichi Morita, Katsunobu Imai
Publication date: 23 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
68Q80: Cellular automata (computational aspects)
Related Items
Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata, Universality of Reversible Hexagonal Cellular Automata, Surprising Areas in the Quest for Small Universal Devices, Emergence of universal global behavior from reversible local transitions in asynchronous systems, Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata, Reversible computing and cellular automata -- a survey, Frontier between decidability and undecidability: A survey, Computational universality of fungal sandpile automata, Number-Conserving Reversible Cellular Automata and Their Computation-Universality, Computation in reversible cellular automata, An 8-State Simple Reversible Triangular Cellular Automaton that Exhibits Complex Behavior
Cites Work
