Reversible computing and cellular automata -- a survey
From MaRDI portal
Publication:924686
DOI10.1016/j.tcs.2008.01.041zbMath1145.68036MaRDI QIDQ924686
Publication date: 19 May 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.01.041
reversible Turing machine; reversible logic element; reversible cellular automata; computation-universality
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
68Q80: Cellular automata (computational aspects)
Related Items
ON 1D REVERSIBLE CELLULAR AUTOMATA WITH REFLECTIVE BOUNDARY OVER THE PRIME FIELD OF ORDER p, Dual P Systems, Fluctuation-driven computing on number-conserving cellular automata, Reversibility of linear cellular automata, Reversibility of 1D cellular automata with periodic boundary over finite fields \({\mathbb{Z}}_{p}\), Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata, Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements, Reversing computation in membrane systems, Reversible pushdown automata, General design of reversible sequential machines based on reversible logic elements, Computation in reversible cellular automata, CELLULAR AUTOMATON SUPERCOLLIDERS
Cites Work
- Firing squad synchronization problem in reversible cellular automata
- Invertible cellular automata: A review
- Conservative logic
- Computation and construction universality of reversible cellular automata
- Injectivity and surjectivity of parallel maps for cellular automata
- Reversibility and surjectivity problems of cellular automata
- Small universal Turing machines
- Universality of a reversible two-counter machine
- Self-reproduction in a reversible cellular space
- A computation-universal two-dimensional 8-state triangular reversible cellular automaton
- Procedures for calculating reversible one-dimensional cellular automata
- Theory of cellular automata: a survey
- Efficient exhaustive listings of reversible one dimensional cellular automata
- Tesselations with local transformations
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- A Universal Reversible Turing Machine
- Small Semi-weakly Universal Turing Machines
- Irreversibility and Heat Generation in the Computing Process
- Time/Space Trade-Offs for Reversible Computation
- Bicontinuous extensions of invertible combinatorial functions
- Condition for injectivity of global maps for tessellation automata
- Surprising Areas in the Quest for Small Universal Devices
- Endomorphisms and automorphisms of the shift dynamical system
- The Garden-of-Eden Theorem for Finite Configurations
- Logical Reversibility of Computation
- Machines, Computations, and Universality
- Four Small Universal Turing Machines
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
