Solvability of the halting problem for certain classes of Turing machines

DOI10.1007/BF01163965MaRDI QIDQ1844660zbMATH OpenOpenAlexFDO

Authors L. M. Pavlotskaya

Publication date 1973

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01163965

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Applications of computability and recursion theory (03D80)

Cited in

(14)

• The complexity of small universal Turing machines: A survey
• Frontier between decidability and undecidability: A survey
• Small fast universal 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
• The laterality problem for non-erasing Turing machines on \lbrace 0,1\rbrace is completely solved
• Surprising areas in the quest for small universal devices
• 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
• On quasi-unilateral universal Turing machines
• Theoretical computer science: computability, decidability and logic
• Busy beaver competition and Collatz-like problems
• Small Turing machines and generalized busy beaver competition
• Instruction sequence processing operators

This page was built for publication: Solvability of the halting problem for certain classes of Turing machines

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