Advertisement

Retraceability, repleteness and busy beaver sets

  • Robert P. Daley
Communications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 118)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Daley, R., On the simplicity of busy beaver sets, Zeit. f. Math. Logik und Grund. d. Math. 24 (1978), 207–224.Google Scholar
  2. 2.
    Daley, R., Busy beaver sets and the degrees of unsolvability, Journal of Symbolic Logic, to appear.Google Scholar
  3. 3.
    Dekker, J., A theorem on hypersimple sets, Proceedings of AMS 5 (1954), 791–796.Google Scholar
  4. 4.
    Soare, R., The infinite injury priority method, Journal of Symbolic Logic 41 (1976), 513–530.Google Scholar
  5. 5.
    Yates, C., Recursively enumerable sets and retracing functions, Zeit. f. Math. Logik und Grund. d. Math. 8 (1962), 331–345.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1981

Authors and Affiliations

  • Robert P. Daley
    • 1
  1. 1.Computer Science DepartmentUniversity of PittsburghPittsburgh

Personalised recommendations