The Solvability of the Halting Problem for 2-State Post Machines
From MaRDI portal
Publication:5546787
DOI10.1145/321420.321426zbMath0163.00903MaRDI QIDQ5546787
Patrick C. Fischer, Stål Aanderaa
Publication date: 1967
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321420.321426
Related Items
The complexity of small universal Turing machines: A survey, Complexity of algorithms and computations, The Complexity of Small Universal Turing Machines: A Survey