Affiliation:
1. Computation Laboratory, Harvard University, Cambridge, Massachusetts
Abstract
From an arbitrary Turing machine,
Z
, a monogenic Post normal system,
v
(
Z
), is constructed. It is then shown not only that the halting problem for
Z
is reducible to that of
v
(
Z
) but also that the halting problem for
v
(
Z
) is reducible to that of
Z
. Since these two halting problems are of the same degree, the halting problem for the normal system can have an arbitrary (recursively enumerable) degree of undecidability.
Publisher
Association for Computing Machinery (ACM)
Subject
Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software
Reference1 articles.
1. ROGERS HERTLY JR. Recursive function and effective computability McGraw-Hill New York (in press) ROGERS HERTLY JR. Recursive function and effective computability McGraw-Hill New York (in press)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Decision problems for tag systems;Journal of Symbolic Logic;1971-06
2. The many-one equivalence of some general combinatorial decision problems;Bulletin of the American Mathematical Society;1971
3. On deterministic normal systems;Zeitschrift für Mathematische Logik und Grundlagen der Mathematik;1969