Reversible computing is a paradigm where computing models are defined so that they
reflect physical reversibility, one of the fundamental microscopic physical property of Nature …

Reversible computing is a paradigm of computation that reflects physical reversibility, and is
considered to be important when designing a logical devices based on microscopic physical …

A cellular automaton (CA) is called reversible (or injective) iff its global function is one-to-
one. It has been shown by Toffoli that any (irreversible) k-dimensional CA is simulated by …

A reversible cellular automaton (RCA) is a cellular automaton (CA) whose global function is
injective and every configuration has at most one predecessor. Margolus showed that there …

A k-counter machine (CM (k)) is an automaton having k counters as an auxiliary memory. It
has been shown by Minsky that a CM (2) can simulate any Turing machine and thus it is …

A known method to compute on an asynchronously updating cellular automaton is the
simulation of a synchronous computing model on it. Such a scheme requires not only an …

There have been several non-axiomatic approaches taken to define quantum cellular
automata (QCA). Partitioned QCA (PQCA) are the most canonical of these non-axiomatic …

Asynchronous cellular arrays have gained attention as promising architectures for
nanocomputers, because of their lack of a clock, which facilitates low power designs, and …

We investigate a problem whether self-reproduction is possible in a two-dimensional
“reversible” cellular space, and give an affirmative answer. A reversible (or injective) cellular …

The idea that our universe can be modelled as a giant computer dates back to the 1970s.
But as Pablo Arrighi and Jonathan Grattage describe, quantum-information theorists are …