Computation and construction universality of reversible cellular automata
From MaRDI portal
Publication:1241491
DOI10.1016/S0022-0000(77)80007-XzbMath0364.94085WikidataQ56001364 ScholiaQ56001364MaRDI QIDQ1241491
Publication date: 1977
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Related Items
Some reversible image operators from the point of view of cellular automata, On time reduction and simulation in cellular spaces, On the size of the inverse neighborhoods for one-dimensional reversible cellular automata, Intrinsic universality of a 1-dimensional reversible Cellular Automaton, Real-time reversible iterative arrays, Universality of a reversible two-counter machine, Self-reproduction in a reversible cellular space, Intractable problems in reversible cellular automata, Spatial/kinematic domain and lattice computers, Universality of 8-State Reversible and Conservative Triangular Partitioned Cellular Automata, Generation of invertible functions, Reversibility problem of multidimensional finite cellular automata, How Can We Construct Reversible Machines Out of Reversible Logic Element with Memory?, Reversible cellular automaton able to simulate any other reversible one using partitioning automata, Reversible computation in term rewriting, The Entropy and Reversibility of Cellular Automata on Cayley Tree, Fundamentals of reversible flowchart languages, A survey of cellular automata: types, dynamics, non-uniformity and applications, Simulation and Intrinsic Universality Among Reversible Cellular Automata, the Partition Cellular Automata Leverage, The Computing Power of Determinism and Reversibility in Chemical Reaction Automata, On the Reversibility of ECAs with Fully Asynchronous Updating: The Recurrence Point of View, On a class of PCA with size-3 neighborhood and their applications in percolation games, The Operators of Vector Logic, Reversible parallel computation: An evolving space-model, On the dynamical behaviour of linear higher-order cellular automata and its decidability, Reversible computing and cellular automata -- a survey, Conservative logic, Algebraic properties of linear cellular automata, Reversible simulation of one-dimensional irreversible cellular automata, Fast reversible language recognition using cellular automata, Nondeterministic cellular automata, Unnamed Item, Unnamed Item, Unnamed Item, Computation-universality of one-dimensional one-way reversible cellular automata, The attractor-basin portrait of a cellular automaton, Intrinsically universal \(n\)-dimensional quantum cellular automata, Partitioned quantum cellular automata are intrinsically universal, Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata, Number-Conserving Reversible Cellular Automata and Their Computation-Universality, Theory of cellular automata: a survey, On the structure of the set of reversible cellular automata, Two-dimensional cellular automata, Universality of Reversible Hexagonal Cellular Automata, An instruction set for reversible Turing machines, When-and how-can a cellular automaton be rewritten as a lattice gas?, Surprising Areas in the Quest for Small Universal Devices, Frontier between decidability and undecidability: A survey, A computation-universal two-dimensional 8-state triangular reversible cellular automaton, ONE-DIMENSIONAL CELLULAR AUTOMATA WITH MEMORY: PATTERNS FROM A SINGLE SITE SEED, Bicontinuous extensions of invertible combinatorial functions, Reversible space-time simulation of cellular automata, Reversible cellular automata with memory: two-dimensional patterns from a single site seed, Computation in reversible cellular automata, Computation theoretic aspects of cellular automata, Invertible cellular automata: A review
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On reversibility in cellular automata
- Tesselations with local transformations
- Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
- Information Theory and Statistical Mechanics
- Tessellation Automata
- Logical Reversibility of Computation
