Computational complexity, speedable and levelable sets

Journal of Symbolic Logic 42 (4):545-563 (1977)
Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2271876
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 32,634
Through your library
References found in this work BETA
Classes of Recursively Enumerable Sets and Degrees of Unsolvability.Donald A. Martin - 1966 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 12 (1):295-310.
A Dichotomy of the Recursively Enumerable Sets.Robert W. Robinson - 1968 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 14 (21-24):339-356.
A Dichotomy of the Recursively Enumerable Sets.Robert W. Robinson - 1968 - Mathematical Logic Quarterly 14 (21‐24):339-356.
Relativized Halting Problems.Alan L. Selman - 1974 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 20 (13‐18):193-198.
Spectra and Halting Problems.Louise Hay - 1975 - Mathematical Logic Quarterly 21 (1):167-176.

Add more references

Citations of this work BETA
Splitting Theorems in Recursion Theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.
Strong Enumeration Reducibilities.Roland Sh Omanadze & Andrea Sorbi - 2006 - Archive for Mathematical Logic 45 (7):869-912.
Completely Mitotic R.E. Degrees.R. G. Downey & T. A. Slaman - 1989 - Annals of Pure and Applied Logic 41 (2):119-152.

View all 10 citations / Add more citations

Similar books and articles
Added to PP index
2009-01-28

Total downloads
20 ( #285,312 of 2,236,127 )

Recent downloads (6 months)
1 ( #446,600 of 2,236,127 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature