A computation-universal two-dimensional 8-state triangular reversible cellular automaton
From MaRDI portal
Recommendations
Cites work
Cited in
(21)- 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
- Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata
- scientific article; zbMATH DE number 1839463 (Why is no real title available?)
- Universality of Reversible Hexagonal Cellular Automata
- Surprising areas in the quest for small universal devices
- Constructing reversible Turing machines in a reversible and conservative elementary triangular cellular automaton
- 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?
- Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible 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
- The complexity of iterated reversible computation
- Composing a rotary element in simple reversible cellular automata to make reversible computers
- Reversible computing and cellular automata -- a survey
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)
