Universal reversible Turing machines with a small number of tape symbols

DOI10.3233/FI-2015-1195MaRDI QIDQ2805443zbMATH OpenOpenAlexFDO

Authors Kenichi Morita

Publication date 11 May 2016

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2015-1195

zbMATH Keywords

reversible computingcyclic tag systemuniversal Turing machine

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• A Universal Reversible Turing Machine
• Four Small Universal Turing Machines
• Four Small Universal Turing Machines
• scientific article; zbMATH DE number 1746682
• The Complexity of Small Universal Turing Machines: A Survey

Cited in

(8)

• Small universal reversible counter machines
• 5-Symbol 8-State and 5-Symbol 6-State Universal Turing Machines
• scientific article; zbMATH DE number 2087234 (Why is no real title available?)
• A simple and efficient universal reversible Turing machine
• scientific article; zbMATH DE number 1746682 (Why is no real title available?)
• A Universal Reversible Turing Machine
• On reversible Turing machines and their function universality
• A small minimal aperiodic reversible Turing machine

This page was built for publication: Universal reversible Turing machines with a small number of tape symbols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2805443)