A simple and efficient universal reversible Turing machine
From MaRDI portal
Recommendations
Cited in
(21)- Universality of a reversible two-counter machine
- An instruction set for reversible Turing machines
- Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines
- Reversible computing from a programming language perspective
- Aspects of reversibility for classical automata
- Compact Realization of Reversible Turing Machines by 2-State Reversible Logic Elements
- Reversible and irreversible computations of deterministic finite-state devices
- When input-driven pushdown automata meet reversiblity
- What do reversible programs compute?
- On reversible Turing machines and their function universality
- Quantum reversible fuzzy grammars
- A small minimal aperiodic reversible Turing machine
- A Universal Reversible Turing Machine
- Minimal reversible deterministic finite automata
- Clean reversible simulations of ranking binary trees
- Towards a taxonomy for reversible computation approaches
- scientific article; zbMATH DE number 7806139 (Why is no real title available?)
- Exploring the energy overhead of reversible programs executed on irreversible hardware
- Semantics for a Turing-complete reversible programming language with inductive types
- A Curry-Howard correspondence for linear, reversible computation
- Fundamentals of reversible flowchart languages
This page was built for publication: A simple and efficient universal reversible Turing machine
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3004571)
