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

DOI10.1016/S0304-3975(99)00099-7MaRDI QIDQ1575918zbMATH OpenOpenAlexFDO

Authors Katsunobu Imai, Kenichi Morita

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

Cellular automata (computational aspects) (68Q80)

Recommendations

• Computation-universality of one-dimensional one-way reversible cellular automata
• Computation in reversible cellular automata
• Simple universal one-dimensional reversible cellular automata
• Developments in Language Theory

Cites work

• scientific article; zbMATH DE number 3761989 (Why is no real title available?)
• Computation and construction universality of reversible cellular automata
• Conservative logic

Cited in

(20)

• Gliders in the game of life and in a reversible cellular automaton
• Computation in reversible cellular automata
• Number-conserving reversible cellular automata and their computation-universality
• A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior
• Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata
• Constructing reversible Turing machines in a reversible and conservative elementary triangular cellular automaton
• On fungal automata
• Reversible elementary triangular partitioned cellular automata and their complex behavior
• Computational universality of fungal sandpile automata
• How Can We Construct Reversible Turing Machines in a Very Simple Reversible Cellular Automaton?
• Surprising areas in the quest for small universal devices
• scientific article; zbMATH DE number 1839463 (Why is no real title available?)
• Universality of Reversible Hexagonal Cellular Automata
• A survey of cellular automata: types, dynamics, non-uniformity and applications
• Reversible computing and cellular automata -- a survey
• Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata
• Frontier between decidability and undecidability: A survey
• An 8-state simple reversible triangular cellular automaton that exhibits complex behavior
• The complexity of iterated reversible computation
• Emergence of universal global behavior from reversible local transitions in asynchronous systems

This page was built for publication: A computation-universal two-dimensional 8-state triangular reversible cellular automaton

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