Small Universal Reversible Counter Machines

DOI10.1007/978-3-319-73216-9_20zbMath1434.68170OpenAlexW2787907319MaRDI QIDQ5112183

Rudolf Freund, Sergey Verlan, Artiom Alhazov

Publication date: 28 May 2020

Published in: Reversibility and Universality (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-73216-9_20

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Other nonclassical models of computation (68Q09)

Cites Work

• The complexity of small universal Turing machines: A survey
• Small universal Turing machines
• Small universal register machines
• Universality of a reversible two-counter machine
• Universal Reversible Turing Machines with a Small Number of Tape Symbols
• Computation in reversible cellular automata
• The Complexity of Small Universal Turing Machines: A Survey
• What Do Reversible Programs Compute?
• Small Universal Non-deterministic Petri Nets with Inhibitor Arcs
• 5-Symbol 8-State and 5-Symbol 6-State Universal Turing Machines
• Logical Reversibility of Computation
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item