Skip to main content
    • Aa
    • Aa
  • Get access
    Check if you have access via personal or institutional login
  • Cited by 9
  • Cited by
    This article has been cited by the following publications. This list is generated based on data provided by CrossRef.

    Galicki, Aleksander and Nies, André 2016. Pursuit of the Universal.

    Kihara, Takayuki and Miyabe, Kenshi 2015. Unified characterizations of lowness properties via Kolmogorov complexity. Archive for Mathematical Logic, Vol. 54, Issue. 3-4, p. 329.

    Porter, Christopher P. 2015. Trivial Measures are not so Trivial. Theory of Computing Systems, Vol. 56, Issue. 3, p. 487.

    Higuchi, Kojiro and Peng, Ningning 2014. Defining a randomness notion via another. Mathematical Logic Quarterly, Vol. 60, Issue. 4-5, p. 280.

    Hölzl, Rupert Kräling, Thorsten Stephan, Frank and Wu, Guohua 2014. Initial segment complexities of randomness notions. Information and Computation, Vol. 234, p. 57.

    Bienvenu, Laurent and Miller, Joseph S. 2012. Randomness and lowness notions via open covers. Annals of Pure and Applied Logic, Vol. 163, Issue. 5, p. 506.

    Yu, Liang 2012. Characterizing strong randomness via Martin-Löf randomness. Annals of Pure and Applied Logic, Vol. 163, Issue. 3, p. 214.

    Cholak, Peter Downey, Rod and Greenberg, Noam 2008. Strong jump-traceability I: The computably enumerable case. Advances in Mathematics, Vol. 217, Issue. 5, p. 2045.

    Miller, Joseph S. and Nies, André 2006. Randomness and Computability: Open Questions. Bulletin of Symbolic Logic, Vol. 12, Issue. 03, p. 390.


Lowness and nullsets

  • Rod Downey (a1), Andre Nies (a2), Rebecca Weber (a3) and Liang Yu (a4)
  • DOI:
  • Published online: 01 March 2014

We prove that there exists a noncomputable c.e. real which is low for weak 2-randomness, a definition of randomness due to Kurtz, and that all reals which are low for weak 2-randomness are low for Martin-Löf randomness.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

[1]R. Downey , E. Griffiths , and S. Reid , On Kurtz randomness, Theoretical Computer Science, vol. 321 (2004), pp. 249270.

[4]P. GÁcs , Every set is reducible to a random one, Information and Control, vol. 70 (1986), pp. 186192.

[10]P. Martin-Löf , The definition of random sequences, Information and Control, vol. 9 (1966), pp. 602619.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Journal of Symbolic Logic
  • ISSN: 0022-4812
  • EISSN: 1943-5886
  • URL: /core/journals/journal-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *