scientific article; zbMATH DE number 522863

MaRDI QIDQ4284259zbMATH OpenFDO

Authors M. Margenstern

Publication date 19 July 1994

zbMATH Keywords

decidable halting problemdeterministic Turing machinesnonerasing Turing machinesTuring machine programuniversality for Turing machines

Mathematics Subject Classification ID

Turing machines and related notions (03D10)

Recommendations

• 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
• Small Turing machines and generalized busy beaver competition
• scientific article; zbMATH DE number 1114344
• Small deterministic Turing machines

Cited in

(12)

• The complexity of small universal Turing machines: A survey
• Small universal Turing machines
• Frontier between decidability and undecidability: A survey
• Bounding lemmata for non-deterministic halting times of transfinite Turing machines
• Wang's B machines are efficiently universal, as is Hasenjaeger's small universal electromechanical toy
• The Complexity of Small Universal Turing Machines: A Survey
• scientific article; zbMATH DE number 4072383 (Why is no real title available?)
• The laterality problem for non-erasing Turing machines on \lbrace 0,1\rbrace is completely solved
• scientific article; zbMATH DE number 1114344 (Why is no real title available?)
• 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
• Logical Approaches to Computational Barriers

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4284259)