A computation-universal two-dimensional 8-state triangular reversible cellular automaton
From MaRDI portal
Publication:1575918
DOI10.1016/S0304-3975(99)00099-7zbMath0951.68086OpenAlexW2122763418MaRDI QIDQ1575918
Kenichi Morita, Katsunobu Imai
Publication date: 23 August 2000
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00099-7
Related Items (18)
An 8-State Simple Reversible Triangular Cellular Automaton that Exhibits Complex Behavior ⋮ Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata ⋮ A survey of cellular automata: types, dynamics, non-uniformity and applications ⋮ A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior ⋮ Computational universality of fungal sandpile automata ⋮ Reversible computing and cellular automata -- a survey ⋮ Emergence of universal global behavior from reversible local transitions in asynchronous systems ⋮ How Can We Construct Reversible Turing Machines in a Very Simple Reversible Cellular Automaton? ⋮ Unnamed Item ⋮ Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata ⋮ Number-Conserving Reversible Cellular Automata and Their Computation-Universality ⋮ Universality of Reversible Hexagonal Cellular Automata ⋮ Surprising Areas in the Quest for Small Universal Devices ⋮ Frontier between decidability and undecidability: A survey ⋮ Gliders in the game of life and in a reversible cellular automaton ⋮ Reversible elementary triangular partitioned cellular automata and their complex behavior ⋮ On fungal automata ⋮ Computation in reversible cellular automata
Cites Work
This page was built for publication: A computation-universal two-dimensional 8-state triangular reversible cellular automaton
