Skip to main content
SpringerLink
Log in

Bounded Randomness

  • Chapter
Computation, Physics and Beyond (WTCS 2012)

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

Included in the following conference series:

Abstract

We introduce some new variations of the notions of being Martin-Löf random where the tests are all clopen sets. We explore how these randomness notions relate to classical randomness notions and to degrees of unsolvability.

Supported by the Marsden Fund of New Zealand. We wish to dedicate this to Cris Calude on the occasion of his 60th Birthday.

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 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barmpalias, G., Downey, R., Greenberg, N.: Working with strong reducibilities above totally ω-c.e. degrees. Transactions of the American Mathematical Society 362, 777–813 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  2. Downey, R.: On \(\Pi^0_1\) classes and their ranked points. Notre Dame Journal of Formal Logic 32(4), 499–512 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  3. Downey, R., Greenberg, N.: Turing degrees of reals of positive effective packing dimension. Information Processing Letters 108, 298–303 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  4. Downey, R., Greenberg, N.: A Hierarchy of Computably Enumerable Degrees, Unifying Classes and Natural Definability (in preparation)

    Google Scholar 

  5. Downey, R., Greenberg, N., Weber, R.: Totally < ω computably enumerable degrees and bounding critical triples. Journal of Mathematical Logic 7, 145–171 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  6. Downey, R., Hirschfeldt, D.: Algorithmic Randomness and Complexity. Springer, Berlin (2010)

    Book  MATH  Google Scholar 

  7. Downey, R., Hirschfeldt, D., Nies, A., Terwijn, S.: Calibrating randomness. Bulletin of Symbolic Logic 3, 411–491 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  8. Downey, R., Jockusch, C., Stob, M.: Array nonrecursive sets and multiple permitting arguments. In: Ambos-Spies, K., Muller, G.H., Sacks, G.E. (eds.) Recursion Theory Week. Lecture Notes in Mathematics, vol. 1432, pp. 141–174. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  9. Downey, R., Jockusch, C., Stob, M.: Array nonrecursive degrees and genericity. In: Cooper, S.B., Slaman, T.A., Wainer, S.S. (eds.) Computability, Enumerability, Unsolvability. London Mathematical Society Lecture Notes Series, vol. 224, pp. 93–105. Cambridge University Press (1996)

    Google Scholar 

  10. Ershov, Y.: A hierarchy of sets, Part 1. Algebra i Logika 7, 47–73 (1968)

    MathSciNet  MATH  Google Scholar 

  11. Ershov, Y.: A hierarchy of sets, Part 2. Algebra i Logika 7, 15–47 (1968)

    MathSciNet  MATH  Google Scholar 

  12. Lathrop, J., Lutz, J.: Recursive computational depth. Information and Computation 153, 139–172 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  13. Nies, A.: Computability and Randomness. Oxford University Press (in preparation)

    Google Scholar 

  14. Stephan, F.: Martin-Löf random sets and PA complete sets. In: Chatzidakis, Z., Koepke, P., Pohlers, W. (eds.) Logic Colloquium 2002, pp. 342–348. ASL and A. K. Peters, La Jolla (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Indian River State College, Fort Pierce, Florida, USA

    Paul Brodhead

  2. School of Math, Statistics, & Operations Research, Victoria University, Cotton Building, Room 358, Gate 7, Kelburn Parade, Wellington, New Zealand

    Rod Downey

  3. School of Physical & Mathematical Sciences, Nanyang Technological University, 21 Nanyang Link, Singapore

    Keng Meng Ng

Authors
  1. Paul Brodhead
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rod Downey
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Keng Meng Ng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Auckland, Private Bag 92019, 1142, Auckland, New Zealand

    Michael J. Dinneen , Bakhadyr Khoussainov  & André Nies ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Brodhead, P., Downey, R., Ng, K.M. (2012). Bounded Randomness. In: Dinneen, M.J., Khoussainov, B., Nies, A. (eds) Computation, Physics and Beyond. WTCS 2012. Lecture Notes in Computer Science, vol 7160. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27654-5_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27654-5_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-27653-8

  • Online ISBN: 978-3-642-27654-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation