The halting problem relativized to complements
HTML articles powered by AMS MathViewer
- by Louise Hay
- Proc. Amer. Math. Soc. 41 (1973), 583-587
- DOI: https://doi.org/10.1090/S0002-9939-1973-0327495-X
- PDF | Request permission
Abstract:
Let ${H^A} = \{ e|{\text {domain}}\{ e\} \cap A \ne \emptyset \}$. It is shown that there exists a set $A$ of Turing degree $a$ such that ${H^A}$ is Turing-incomparable to ${H^{\bar A}}$ whenever $a$ is an r.e. degree with $a’ > 0’$, or $a \geqq 0''$ or $a \geqq 0’$ and $a$ is r.e. in 0’. This contrasts with the fact that ${H^A}$ is comparable to ${H^{\bar A}}$ for almost all $A$.References
- J. C. E. Dekker and J. Myhill, Retraceable sets, Canadian J. Math. 10 (1958), 357–373. MR 99292, DOI 10.4153/CJM-1958-035-x
- Louise Hay, The class of recursively enumerable subsets of a recursively enumerable set, Pacific J. Math. 46 (1973), 167–183. MR 392525
- Carl G. Jockusch Jr., The degrees of bi-immune sets, Z. Math. Logik Grundlagen Math. 15 (1969), 135–140. MR 244043, DOI 10.1002/malq.19690150707
- Robert W. Robinson, Interpolation and embedding in the recursively enumerable degrees, Ann. of Math. (2) 93 (1971), 285–314. MR 274286, DOI 10.2307/1970776
- Hartley Rogers Jr., Theory of recursive functions and effective computability, McGraw-Hill Book Co., New York-Toronto-London, 1967. MR 0224462
- Alan L. Selman, Applications of forcing to the degree-theory of the arithmetical hierarchy, Proc. London Math. Soc. (3) 25 (1972), 586–602. MR 314604, DOI 10.1112/plms/s3-25.4.586 —, Relativized halting problems (to appear).
- J. R. Shoenfield, On degrees of unsolvability, Ann. of Math. (2) 69 (1959), 644–653. MR 105355, DOI 10.2307/1970028
- John Stillwell, Decidability of the “almost all” theory of degrees, J. Symbolic Logic 37 (1972), 501–506. MR 349369, DOI 10.2307/2272735
Bibliographic Information
- © Copyright 1973 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 41 (1973), 583-587
- MSC: Primary 02F30; Secondary 02F25
- DOI: https://doi.org/10.1090/S0002-9939-1973-0327495-X
- MathSciNet review: 0327495