Solvability of the halting problem for certain classes of Turing machines
From MaRDI portal
Publication:1844660
DOI10.1007/BF01163965zbMath0284.02017OpenAlexW2054743028MaRDI QIDQ1844660
Publication date: 1973
Published in: Mathematical Notes (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01163965
Applications of computability and recursion theory (03D80) Turing machines and related notions (03D10)
Related Items
The Complexity of Small Universal Turing Machines: A Survey, 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, Busy beaver competition and Collatz-like problems, Small Turing machines and generalized busy beaver competition, On quasi-unilateral universal Turing machines, Instruction sequence processing operators, 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, Surprising Areas in the Quest for Small Universal Devices, Maurice Margenstern’s Contributions to the Field of Small Universal Turing Machines, Frontier between decidability and undecidability: A survey
Cites Work
