Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. R. Friedberg, Two recursively enumerable sets of incomparable degrees of unsolvability, Proc. Nat. Acad. Sci. 43 (1957), 236–238.
2. A. A. Muchnik, On the unsolvability of the problem of reducibility in the theory of algorithms, Doklady Akad. Nauk SSSR 108 (1956), 194–197.
3. G. Driscoll, Metarecursively enumerable sets and their metadegrees, Jour. Symb. Log. 33 (1968), 389–411.
4. R. Shore, The irregular and non-hyperregular α-r.e. degrees, Israel Jour. Math. 22 (1975), 28–41.
5. G. E. Sacks, Post's problem, admissible ordinals and regularity, Trans. Amer. Math. Soc. 124 (1966), 1–23.