On quasi-unilateral universal Turing machines

DOI10.1016/S0304-3975(00)00114-6zbMath0973.68068MaRDI QIDQ5941258

Maurice Margenstern

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

theory of computation

Mathematics Subject Classification ID

Related Items

The Complexity of Small Universal Turing Machines: A Survey ⋮ A DNA computing inspired computational model ⋮ The complexity of small universal Turing machines: A survey ⋮ Maurice Margenstern’s Contributions to the Field of Small Universal Turing Machines ⋮ Computing by Floating Strings

Cites Work

• Solvability of the halting problem for certain classes of Turing machines
• Tag systems and lag systems
• Non-erasing turing machines: A new frontier between a decidable halting problem and universality
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item