Pages that link to "Item:Q3004571"
From MaRDI portal
The following pages link to A Simple and Efficient Universal Reversible Turing Machine (Q3004571):
Displaying 13 items.
- On reversible Turing machines and their function universality (Q303695) (← links)
- A small minimal aperiodic reversible Turing machine (Q340590) (← links)
- Fundamentals of reversible flowchart languages (Q896906) (← links)
- Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines (Q2420575) (← links)
- Reversible computing from a programming language perspective (Q2693633) (← links)
- Aspects of Reversibility for Classical Automata (Q2944881) (← links)
- Compact Realization of Reversible Turing Machines by 2-State Reversible Logic Elements (Q2945544) (← links)
- Reversible and Irreversible Computations of Deterministic Finite-State Devices (Q2946323) (← links)
- When input-driven pushdown automata meet reversiblity (Q2969982) (← links)
- Quantum Reversible Fuzzy Grammars (Q3305479) (← links)
- Minimal Reversible Deterministic Finite Automata (Q4640040) (← links)
- Clean Reversible Simulations of Ranking Binary Trees (Q5112174) (← links)
- Exploring the energy overhead of reversible programs executed on irreversible hardware (Q6637588) (← links)