A computation-universal two-dimensional 8-state triangular reversible cellular automaton

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)

Full work available at URL: https://doi.org/10.1016/s0304-3975(99)00099-7

zbMATH Keywords

reversible cellular automaton

Mathematics Subject Classification ID

68Q80: Cellular automata (computational aspects)

Related Items

Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata, Unnamed Item, Universality of Reversible Hexagonal Cellular Automata, Surprising Areas in the Quest for Small Universal Devices, How Can We Construct Reversible Turing Machines in a Very Simple Reversible Cellular Automaton?, 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, 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, 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, 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

• Conservative logic
• Computation and construction universality of reversible cellular automata
• Unnamed Item