The Solvability of the Halting Problem for 2-State Post Machines-Reference-Cited by-同舟云学术

The Solvability of the Halting Problem for 2-State Post Machines

Published:1967-10 Issue:4 Volume:14 Page:677-682
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Aanderaa Stål¹,Fischer Patrick C.²

Affiliation:

1. Oslo University, Oslo, Norway

2. Cornell University, Ithaca, New York

Abstract

A Post machine is a Turing machine which cannot both write and move on the same machine step. It is shown that the halting problem for the class of 2-state Post machines is solvable. Thus, there can be no universal 2-state Post machine. This is in contrast with the result of Shannon that there exist universal 2-state Turing machines when the machines are capable of both writing and moving on the same step.

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Link

https://dl.acm.org/doi/pdf/10.1145/321420.321426

Reference5 articles.

1. On Formalisms for Turing Machines

2. Recursive Unsolvability of a problem of Thue

3. SHANNON C.E. A universal Turing machine with two internal states. In Automata Studies Shannon C. E. and McCarthy J. (Eds.) Princeton U. Press Princeton N. J. 1956. SHANNON C.E. A universal Turing machine with two internal states. In Automata Studies Shannon C. E. and McCarthy J. (Eds.) Princeton U. Press Princeton N. J. 1956.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Complexity of Small Universal Turing Machines: A Survey;SOFSEM 2012: Theory and Practice of Computer Science;2012

2. The complexity of small universal Turing machines: A survey;Theoretical Computer Science;2009-02

3. New Small Universal Circular Post Machines;Fundamentals of Computation Theory;2001

4. Complexity of algorithms and computations;Journal of Soviet Mathematics;1981

5. Solvability of the uniform halting problem in the class of two-state post machines;Cybernetics;1978-01