An instruction set for reversible Turing machines

DOI10.1007/S00236-020-00388-1OpenAlexW3186319166MaRDI QIDQ2041688

Kenichi Morita

Publication date: 23 July 2021

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-020-00388-1

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Uses Software

• Golly

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Conservative logic
• Computation and construction universality of reversible cellular automata
• Theory of reversible computing
• Reversible nondeterministic finite automata
• Reversible pushdown automata
• One-way reversible multi-head finite automata
• Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy
• Aspects of Reversibility for Classical Automata
• Compact Realization of Reversible Turing Machines by 2-State Reversible Logic Elements
• A Deterministic Two-Way Multi-head Finite Automaton Can Be Converted into a Reversible One with the Same Number of Heads
• A Universal Reversible Turing Machine
• Inference of Reversible Languages
• Constructing Reversible Turing Machines by Reversible Logic Element with Memory
• Logical Reversibility of Computation

This page was built for publication: An instruction set for reversible Turing machines