scientific article; zbMATH DE number 522863
From MaRDI portal
zbMath0794.68047MaRDI QIDQ4284259
Publication date: 19 July 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
deterministic Turing machinesTuring machine programdecidable halting problemnonerasing Turing machinesuniversality for Turing machines
Related Items
The Complexity of Small Universal Turing Machines: A Survey, Small universal Turing machines, Non-erasing turing machines: A new frontier between a decidable halting problem and universality, The laterality problem for non-erasing Turing machines on $\lbrace 0,1\rbrace $ is completely solved, Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy, The complexity of small universal Turing machines: A survey, Maurice Margenstern’s Contributions to the Field of Small Universal Turing Machines, Frontier between decidability and undecidability: A survey