A Universal Reversible Turing Machine
From MaRDI portal
Recommendations
Cited in
(18)- The complexity of small universal Turing machines: A survey
- A universal machine without change of state
- Universality of a reversible two-counter machine
- Sequential and maximally parallel multiset rewriting: reversibility and determinism
- An instruction set for reversible Turing machines
- Reversible spiking neural P systems
- Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines
- A physically universal Turing machine
- Universal reversible Turing machines with a small number of tape symbols
- The Complexity of Small Universal Turing Machines: A Survey
- A simple and efficient universal reversible Turing machine
- On reversible Turing machines and their function universality
- A small minimal aperiodic reversible Turing machine
- Small universal reversible counter machines
- Simulating reversible Turing machines and cyclic tag systems by one-dimensional reversible cellular automata
- A Curry-Howard correspondence for linear, reversible computation
- Fundamentals of reversible flowchart languages
- Reversible computing and cellular automata -- a survey
This page was built for publication: A Universal Reversible Turing Machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608473)