On the simplification of constructions in degrees of unsolvability via computational complexity

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


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Blum, M., "A machine independent theory of the complexity of recursive functions", JACM 14 (1967), 322–336.CrossRefGoogle Scholar
  2. 2.
    Daley, R., "On the simplicity of busy beaver sets", Zeit. für Math. Logik und Grund. der Math. 24 (1978), 207–224.Google Scholar
  3. 3.
    Daley, R., "Busy beaver sets and the degrees of unsolvability (revised)", Technical Report 78-2 (1978), Computer Science Department, University of Pittsburgh.Google Scholar
  4. 4.
    Lynch, N., Meyer, A., and Fischer, M., "Relativizations of the theory of computational complexity", Transactions AMS 220 (1976), 243–287.Google Scholar
  5. 5.
    Rogers, H., Theory of Recursive Functions and Effective Computability, McGraw Hill (1967).Google Scholar
  6. 6.
    Sacks, G., "The recursively enumerable sets are dense", Annals of Math. 80 (1964), 300–312.Google Scholar
  7. 7.
    Shoenfield, J., Degrees of Unsolvability, North Holland (1971).Google Scholar
  8. 8.
    Symes, M., "The extension of machine-independent computational complexity theory to oracle machine computation and to the computation of finite functions", Ph. D. Dissertation, Department of Applied Analysis and Computer Science, University of Waterloo (1971).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1979

Authors and Affiliations

  • Robert P. Daley
    • 1
  1. 1.University of PittsburghPittsburghUSA

Personalised recommendations