Pages that link to "Item:Q1349861"

The following pages link to Universality of a reversible two-counter machine (Q1349861):

Displaying 18 items.

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