Skip to main content
SpringerLink
Log in

Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions

  • Chapter
  • First Online:
Computability and Complexity

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10010))

Abstract

Let \(\varphi _i\), \(i\in \mathbb {N}\) be a standard enumeration of the 1-place partial recursive functions \(\varphi :\;\subseteq \mathbb {N}\rightarrow \mathbb {N}\).

In honor of Rod Downey’s 60th birthday.

This research was partially supported by Simons Foundation Collaboration Grant 276282.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    For an explanation of what we mean by specific and natural, see [19, footnote 2].

References

  1. Ambos-Spies, K., Kjos-Hanssen, B., Lempp, S., Slaman, T.A.: Comparing DNR and WWKL. J. Symbolic Logic 69(4), 1089–1104 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  2. Beckmann, A., Mitrana, V., Soskova, M. (eds.): CiE 2015. LNCS, vol. 9136. Springer, Heidelberg (2015)

    Google Scholar 

  3. Bienvenu, L., Porter, C.P.: Deep \(\Pi ^0_1\) classes. Bull. Symbolic Logic 22(2), 249–286 (2016)

    Article  MathSciNet  Google Scholar 

  4. Chatzidakis, Z., Koepke, P., Pohlers, W. (eds.): Logic Colloquium 2002. Lecture Notes in Logic, no. 27. Association for Symbolic Logic, VIII + 359 pages (2006)

    Google Scholar 

  5. Fenstad, J.-E., Frolov, I.T., Hilpinen, R. (eds.): Logic, Methodology and Philosophy of Science VIII. Studies in Logic and the Foundations of Mathematics, no. 126. North-Holland, XVII + 702 pages (1989)

    Google Scholar 

  6. Franklin, J.N.Y., Ng, K.M.: Difference randomness. Proc. Am. Math. Soc. 139(1), 345–360 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  7. Greenberg, N., Miller, J.S.: Diagonally non-recursive functions and effective Hausdorff dimension. Bull. Lond. Math. Soc. 43(4), 636–654 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  8. Higuchi, K., Hudelson, P.W.M., Simpson, S.G., Yokoyama, K.: Propagation of partial randomness. Ann. Pure Appl. Logic 165(2), 742–758 (2014). http://dx.doi.org/10.1016/j.apal.2013.10.006

  9. Hudelson, P.W.M.: Mass problems and initial segment complexity. J. Symbolic Logic 79(1), 20–44 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  10. Jockusch Jr., C.G.: Degrees of functions with no fixed points. In: [5], pp. 191–201 (1989)

    Google Scholar 

  11. Khan, M.: Some results on algorithmic randomness and computability-theoretic strength. Ph.D. thesis, University of Wisconsin, VII + 93 pages (2014)

    Google Scholar 

  12. Kjos-Hanssen, B., Merkle, W., Stephan, F.: Kolmogorov complexity and the recursion theorem. Trans. Am. Math. Soc. 363(10), 5465–5480 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  13. Kjos-Hanssen, B., Simpson, S.G.: Mass problems and Kolmogorov complexity. 4 October 2006. Preprint, 1 page (2006)

    Google Scholar 

  14. Rogers Jr., H.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, XIX + 482 pages (1967)

    Google Scholar 

  15. Simpson, S.G.: Mass problems and randomness. Bull. Symbolic Logic 11(1), 1–27 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  16. Simpson, S.G.: Almost everywhere domination and superhighness. Math. Logic Q. 53(4–5), 462–482 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  17. Simpson, S.G.: An extension of the recursively enumerable Turing degrees. J. Lond. Math. Soc. 75(2), 287–297 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  18. Simpson, S.G.: Mass problems associated with effectively closed sets. Tohoku Math. J. 63(4), 489–517 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  19. Simpson, S.G.: Degrees of unsolvability: a tutorial. In: [2], pp. 83–94 (2015)

    Google Scholar 

  20. Stephan, F.: Martin-Löf random and PA-complete sets. In: [4], pp. 341–347 (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Vanderbilt University, Nashville, Tennessee, 37240, USA

    Stephen G. Simpson

Authors
  1. Stephen G. Simpson
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Stephen G. Simpson .

Editor information

Editors and Affiliations

  1. Victoria University of Wellington, Wellington, New Zealand

    Adam Day

  2. University of Bergen, Bergen, Norway

    Michael Fellows

  3. Victoria University of Wellington, Wellington, New Zealand

    Noam Greenberg

  4. University of Auckland, Auckland, New Zealand

    Bakhadyr Khoussainov

  5. Massey University, Auckland, New Zealand

    Alexander Melnikov

  6. University of Bergen, Bergen, Norway

    Frances Rosamond

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this chapter

Cite this chapter

Simpson, S.G. (2017). Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions. In: Day, A., Fellows, M., Greenberg, N., Khoussainov, B., Melnikov, A., Rosamond, F. (eds) Computability and Complexity. Lecture Notes in Computer Science(), vol 10010. Springer, Cham. https://doi.org/10.1007/978-3-319-50062-1_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-50062-1_40

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-50061-4

  • Online ISBN: 978-3-319-50062-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation