Reversible elementary triangular partitioned cellular automata and their complex behavior
From MaRDI portal
Recommendations
- A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior
- An 8-state simple reversible triangular cellular automaton that exhibits complex behavior
- Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata
- Emergence of Complex Phenomena in a Simple Reversible Cellular Space
- Constructing reversible Turing machines in a reversible and conservative elementary triangular cellular automaton
Cites work
- scientific article; zbMATH DE number 1731510 (Why is no real title available?)
- scientific article; zbMATH DE number 3986649 (Why is no real title available?)
- scientific article; zbMATH DE number 759417 (Why is no real title available?)
- A computation-universal two-dimensional 8-state triangular reversible cellular automaton
- Conservative logic
- Logical Reversibility of Computation
- Theory of reversible computing
- UNIVERSAL CELLULAR AUTOMATON OVER A HEXAGONAL TILING WITH 3 STATES
- Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata
Cited in
(3)
This page was built for publication: Reversible elementary triangular partitioned cellular automata and their complex behavior
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2086737)