Maurice Margenstern’s Contributions to the Field of Small Universal Turing Machines
From MaRDI portal
Publication:4982992
DOI10.1007/978-3-319-09039-9_5zbMath1328.68068OpenAlexW28846582MaRDI QIDQ4982992
Publication date: 14 April 2015
Published in: Automata, Universality, Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-09039-9_5
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Small Turing machines and generalized busy beaver competition
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- Small universal Turing machines
- Small deterministic Turing machines
- Frontier between decidability and undecidability: A survey
- Solvability of the halting problem for certain classes of Turing machines
- Small fast universal Turing machines
- The Complexity of Small Universal Turing Machines: A Survey
- ON THE OPTIMAL NUMBER OF INSTRUCTIONS FOR UNIVERSAL TURING MACHINES CONNECTED WITH A FINITE AUTOMATON
- The 3x + 1 Problem and Its Generalizations
- MINSKY'S SMALL UNIVERSAL TURING MACHINE
- The laterality problem for non-erasing Turing machines on $\lbrace 0,1\rbrace $ is completely solved
- Non-erasing turing machines: A new frontier between a decidable halting problem and universality
- Universality of Tag Systems with P = 2
- Formal Reductions of the General Combinatorial Decision Problem
- Four Small Universal Turing Machines
- On quasi-unilateral universal Turing machines
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Maurice Margenstern’s Contributions to the Field of Small Universal Turing Machines
