Reversible computing and cellular automata -- a survey
type: Item
instance of: scholarly article
title: Reversible computing and cellular automata -- a survey
zbMATH Open document ID: 1145.68036
author: Kenichi Morita
published in: Theoretical Computer Science
publication date: 2008-05-19T00:00:00Z
Mathematics Subject Classification ID: 68Q80
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 94C10
zbMATH DE Number: 5276399
zbMATH Keywords: reversible logic element
zbMATH Keywords: reversible Turing machine
zbMATH Keywords: reversible cellular automata
zbMATH Keywords: computation-universality
MaRDI profile type: Publication
full work available at URL: j.tcs.2008.01.041
OpenAlex ID: W1998896169
cites work: The Garden-of-Eden Theorem for Finite Configurations
cites work: Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures
cites work: Q4530860
cites work: Logical Reversibility of Computation
cites work: Time/Space Trade-Offs for Reversible Computation
cites work: Efficient exhaustive listings of reversible one dimensional cellular automata
cites work: Q5321501
cites work: Conservative logic
cites work: Endomorphisms and automorphisms of the shift dynamical system
cites work: Firing squad synchronization problem in reversible cellular automata
cites work: A computation-universal two-dimensional 8-state triangular reversible cellular automaton
cites work: Reversibility and surjectivity problems of cellular automata
cites work: Theory of cellular automata: a survey
cites work: Q4737918
cites work: Irreversibility and Heat Generation in the Computing Process
cites work: Q5586334
cites work: Surprising Areas in the Quest for Small Universal Devices
cites work: Q3677179
cites work: Condition for injectivity of global maps for tessellation automata
cites work: Injectivity and surjectivity of parallel maps for cellular automata
cites work: Q5590814
cites work: Q5642506
cites work: Procedures for calculating reversible one-dimensional cellular automata
cites work: Universality of a reversible two-counter machine
cites work: Self-reproduction in a reversible cellular space
cites work: Q4529993
cites work: Q4453218
cites work: Machines, Computations, and Universality
cites work: A Universal Reversible Turing Machine
cites work: Q5446408
cites work: Q5642507
cites work: Four Small Universal Turing Machines
cites work: Q5539752
cites work: Tesselations with local transformations
cites work: Small universal Turing machines
cites work: Computation and construction universality of reversible cellular automata
cites work: Q3886867
cites work: Bicontinuous extensions of invertible combinatorial functions
cites work: Invertible cellular automata: A review
cites work: Small Semi-weakly Universal Turing Machines
DOI: 10.1016/J.TCS.2008.01.041
description: scientific article; zbMATH DE number 5276399