Skip to main content
    • Aa
    • Aa

Lowness and nullsets

  • Rod Downey (a1), Andre Nies (a2), Rebecca Weber (a3) and Liang Yu (a4)

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


Full text views

Total number of HTML views: 0
Total number of PDF views: 2 *
Loading metrics...

Abstract views

Total abstract views: 38 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 20th August 2017. This data will be updated every 24 hours.