Universality of a reversible two-counter machine
From MaRDI portal
Publication:1349861
DOI10.1016/S0304-3975(96)00081-3zbMath0874.68108MaRDI QIDQ1349861
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Related Items (19)
Decidability Versus Undecidability of the Word Problem in Amalgams of Inverse Semigroups ⋮ Amalgams of inverse semigroups and reversible two-counter machines. ⋮ Undecidability of the Surjectivity of the Subshift Associated to a Turing Machine ⋮ Reversible spiking neural P systems ⋮ Unnamed Item ⋮ Some undecidability results for asynchronous transducers and the Brin-Thompson group $2V$ ⋮ The Computing Power of Determinism and Reversibility in Chemical Reaction Automata ⋮ Small Universal Reversible Counter Machines ⋮ Unnamed Item ⋮ Reversible computing and cellular automata -- a survey ⋮ The fixed point problem of a simple reversible language ⋮ New Undecidability Results for Properties of Term Rewrite Systems ⋮ Sequential and maximally parallel multiset rewriting: reversibility and determinism ⋮ Number-Conserving Reversible Cellular Automata and Their Computation-Universality ⋮ Quantum versus deterministic counter automata ⋮ Periodicity and Immortality in Reversible Computing ⋮ Undecidability of the speed positiveness problem in reversible and complete Turing machines ⋮ Unification modulo lists with reverse relation with certain word equations ⋮ Automata on the plane vs particles and collisions
Cites Work
This page was built for publication: Universality of a reversible two-counter machine
