An 8-state simple reversible triangular cellular automaton that exhibits complex behavior
From MaRDI portal
Recommendations
- Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata
- Gliders in the game of life and in a reversible cellular automaton
- Constructing reversible Turing machines in a reversible and conservative elementary triangular cellular automaton
- A computation-universal two-dimensional 8-state triangular reversible cellular automaton
- Universality of Reversible Hexagonal Cellular Automata
Cites work
- A computation-universal two-dimensional 8-state triangular reversible cellular automaton
- Conservative logic
- scientific article; zbMATH DE number 1818513 (Why is no real title available?)
- scientific article; zbMATH DE number 3898247 (Why is no real title available?)
- scientific article; zbMATH DE number 3986649 (Why is no real title available?)
- scientific article; zbMATH DE number 3761989 (Why is no real title available?)
- scientific article; zbMATH DE number 1738656 (Why is no real title available?)
- Logical Reversibility of Computation
Cited in
(7)- Gliders in the game of life and in a reversible cellular automaton
- Reversible elementary triangular partitioned cellular automata and their complex behavior
- Realization of a tri-valued programmable cellular automata with ternary optimal computer
- Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata
- Constructing reversible Turing machines in a reversible and conservative elementary triangular cellular automaton
- Emergence of Complex Phenomena in a Simple Reversible Cellular Space
- A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior
This page was built for publication: An 8-state simple reversible triangular cellular automaton that exhibits complex behavior
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3186483)
