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
New Undecidability Results for Properties of Term Rewrite Systems, 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, Amalgams of inverse semigroups and reversible two-counter machines., 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