Universality of a reversible two-counter machine

DOI10.1016/S0304-3975(96)00081-3zbMath0874.68108MaRDI QIDQ1349861

Kenichi Morita

Publication date: 27 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Related Items

The Computing Power of Determinism and Reversibility in Chemical Reaction Automata, Small Universal Reversible Counter Machines, New Undecidability Results for Properties of Term Rewrite Systems, Unnamed Item, Reversible computing and cellular automata -- a survey, Automata on the plane vs particles and collisions, Sequential and maximally parallel multiset rewriting: reversibility and determinism, Quantum versus deterministic counter automata, The fixed point problem of a simple reversible language, Undecidability of the speed positiveness problem in reversible and complete Turing machines, Unification modulo lists with reverse relation with certain word equations, Amalgams of inverse semigroups and reversible two-counter machines., Reversible spiking neural P systems, Number-Conserving Reversible Cellular Automata and Their Computation-Universality, Some undecidability results for asynchronous transducers and the Brin-Thompson group $2V$, Decidability Versus Undecidability of the Word Problem in Amalgams of Inverse Semigroups, Undecidability of the Surjectivity of the Subshift Associated to a Turing Machine, Periodicity and Immortality in Reversible Computing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Invertible cellular automata: A review
• Conservative logic
• Computation and construction universality of reversible cellular automata
• Logical Reversibility of Computation