This work was supported by NSF grant 76-00102A.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Daley, R., On the simplicity of busy beaver sets, Zeit. f. Math. Logik und Grund. d. Math. 24 (1978), 207–224.
Daley, R., Busy beaver sets and the degrees of unsolvability, Journal of Symbolic Logic, to appear.
Dekker, J., A theorem on hypersimple sets, Proceedings of AMS 5 (1954), 791–796.
Soare, R., The infinite injury priority method, Journal of Symbolic Logic 41 (1976), 513–530.
Yates, C., Recursively enumerable sets and retracing functions, Zeit. f. Math. Logik und Grund. d. Math. 8 (1962), 331–345.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Daley, R.P. (1981). Retraceability, repleteness and busy beaver sets. In: Gruska, J., Chytil, M. (eds) Mathematical Foundations of Computer Science 1981. MFCS 1981. Lecture Notes in Computer Science, vol 118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10856-4_91
Download citation
DOI: https://doi.org/10.1007/3-540-10856-4_91
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10856-6
Online ISBN: 978-3-540-38769-5
eBook Packages: Springer Book Archive