Computational complexity, speedable and levelable sets

[1]  R. Soare.  Automorphisms of the Lattice of Recursively Enumerable Sets Part I: Maximal Sets , 1974 .

[2]  A. Lachlan.  The elementary theory of recursively enumerable sets , 1968 .

[3]  Louise Hay.  The halting problem relativized to complements , 1973 .

[4]  Gerald E. Sacks,et al.  Recursive enumerability and the jump operator , 1963 .

[5]  C. E. M. Yates,et al.  Three theorems on the degrees of recursively enumerable sets , 1965 .

[6]  Louise Hay,et al.  The class of recursively enumerable subsets of a recursively enumerable set , 1973 .

[7]  Donald A. Martin,et al.  Classes of Recursively Enumerable Sets and Degrees of Unsolvability , 1966 .

[8]  Manuel Blum,et al.  A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.

[9]  Alan L. Selman,et al.  Relativized Halting Problems , 1974 .

[10]  Manuel Blum,et al.  On Effective Procedures for Speeding Up Algorithms , 1971, JACM.

[11]  A. Lachlan.  ON THE LATTICE OF RECURSIVELY ENUMERABLE SETS , 1968 .

[12]  Robert W. Robinson,et al.  Interpolation and Embedding in the Recursively Enumerable Degrees , 1971 .

[13]  Carl G. Jockusch,et al.  Relationships between reducibilities , 1969 .

[14]  R. Soare.  Automorphisms of the lattice of recursively enumerable sets , 1974 .

[15]  Louise Hay,et al.  Spectra and halting problems , 1975, Math. Log. Q..

[16]  Emil L. Post.  Recursively enumerable sets of positive integers and their decision problems , 1944 .

[17]  Robert W. Robinson.  A Dichotomy of the Recursively Enumerable Sets , 1968 .

[18]  Paul Henry Morris.  Complexity theoretic properties of recursively enumerable sets , 1974 .