Publication:4284259
From MaRDI portal
zbMath0794.68047MaRDI QIDQ4284259
Publication date: 19 July 1994
deterministic Turing machines; Turing machine program; decidable halting problem; nonerasing Turing machines; universality for Turing machines
03D10: Turing machines and related notions
Related Items
The laterality problem for non-erasing Turing machines on $\lbrace 0,1\rbrace $ is completely solved, Maurice Margenstern’s Contributions to the Field of Small Universal Turing Machines, Non-erasing turing machines: A new frontier between a decidable halting problem and universality, The complexity of small universal Turing machines: A survey, Small universal Turing machines, Frontier between decidability and undecidability: A survey, Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy, The Complexity of Small Universal Turing Machines: A Survey