On the Simplicity of Busy Beaver Sets

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

[2]  C. E. M. Yates,et al.  Recursively Enumerable Sets and Retracing Functions , 1962 .

[3]  Albert R. Meyer,et al.  Classes of computable functions defined by bounds on computation: Preliminary Report , 1969, STOC.

[4]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

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

[6]  Thomas McLaughlin,et al.  Supersimple sets and the problem of extending a retracing function , 1972 .

[7]  Manuel Blum.  On the Size of Machines , 1967, Inf. Control..

[8]  Richard E. Ladner,et al.  Mitotic recursively enumerable sets , 1973, Journal of Symbolic Logic.

[9]  Robert I. Soare,et al.  Computational complexity, speedable and levelable sets , 1977, Journal of Symbolic Logic.

[10]  Carl G. Jockusch.  Uniformly Introreducible Sets , 1968, J. Symb. Log..

[11]  Shen Lin,et al.  Computer Studies of Turing Machine Problems , 1965, JACM.

[12]  A. N. Degtev.  Hypersimple sets with retraceable complements , 1971 .

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

[14]  Manuel Blum,et al.  On Complexity Properties of Recursively Enumerable Sets , 1973, J. Symb. Log..

[15]  Robert P. Daley.  On the Inference of Optimal Descriptions , 1977, Theor. Comput. Sci..

[16]  Paul H. Morris,et al.  On Subcreative Sets and S-Reducibility , 1974, J. Symb. Log..

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

[18]  Stuart Barry Cooper.  Degrees of Unsolvability , 1971 .

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

[20]  Richard M. Friedberg,et al.  Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication , 1958, Journal of Symbolic Logic.

[21]  T. G. Mclaughlin.  Some remarks on extensibility, confluence of paths, branching properties, and index sets, for certain recursively enumerable graphs , 1967 .

[22]  Paul R. Young,et al.  Linear orderings under one-one reducibility , 1966, Journal of Symbolic Logic.

[23]  T. Rado.  On non-computable functions , 1962 .

[24]  Robert P. Daley.  Noncomplex Sequences: Characterizations and Examples , 1976, J. Symb. Log..