On the Simplicity of Busy Beaver Sets
- 1 January 1978
- journal article
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 24 (13-14) , 207-224
- https://doi.org/10.1002/malq.19780241303
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- Noncomplex sequences: characterizations and examplesThe Journal of Symbolic Logic, 1976
- Automorphisms of the Lattice of Recursively Enumerable Sets Part I: Maximal SetsAnnals of Mathematics, 1974
- On complexity properties of recursively enumerable setsThe Journal of Symbolic Logic, 1973
- Mitotic recursively enumerable setsThe Journal of Symbolic Logic, 1973
- Supersimple sets and the problem of extending a retracing functionPacific Journal of Mathematics, 1972
- Recursive Properties of Abstract Complexity ClassesJournal of the ACM, 1972
- On Effective Procedures for Speeding Up AlgorithmsJournal of the ACM, 1971
- Uniformly introreducible setsThe Journal of Symbolic Logic, 1969
- Linear orderings under one-one reducibilityThe Journal of Symbolic Logic, 1966
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplicationThe Journal of Symbolic Logic, 1958