Universal reversible Turing machines with a small number of tape symbols

DOI10.3233/FI-2015-1195zbMATH Open1335.68091OpenAlexW1491991654MaRDI QIDQ2805443FDOQ2805443

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

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

zbMATH Keywords

reversible computingcyclic tag systemuniversal Turing machine

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cited In (8)

• Title not available (Why is that?)
• A Universal Reversible Turing Machine
• On reversible Turing machines and their function universality
• Title not available (Why is that?)
• Small universal reversible counter machines
• A small minimal aperiodic reversible Turing machine
• 5-Symbol 8-State and 5-Symbol 6-State Universal Turing Machines
• A simple and efficient universal 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)