Skip to main content Accessibility help

Lowness for Kurtz randomness

  • Noam Greenberg (a1) and Joseph S. Miller (a2)


We prove that degrees that are low for Kurtz randomness cannot be diagonally non-recursive. Together with the work of Stephan and Yu [16], this proves that they coincide with the hyperimmune-free non-DNR degrees, which are also exactly the degrees that are low for weak 1-genericity.

We also consider Low(, Kurtz), the class of degrees a such that every element of is a-Kurtz random. These are characterised when is the class of Martin-Löf random, computably random, or Schnorr random reals. We show that Low(ML, Kurtz) coincides with the non-DNR degrees, while both Low(CR, Kurtz) and Low(Schnorr, Kurtz) are exactly the non-high, non-DNR degrees.



Hide All
[1]Downey, Rod, Hirschfeldt, Denis R., Nies, André, and Terwijn, Sebastiaan A., Calibrating randomness, The Bulletin of Symbolic Logic, vol. 12 (2006), no. 3, pp. 411491.
[2]Downey, Rod, Nies, André, Weber, Rebecca, and Yu, Liang, Lowness and Π20 nullsets, this Journal, vol. 71 (2006), no. 3, pp. 10441052.
[3]Downey, Rodney G., Griffiths, Evan J., and Reid, Stephanie, On Kurtz randomness. Theoretical Computer Science, vol. 321 (2004), no. 2-3, pp. 249270.
[4]Kjos-Hanssen, Bjørn and Diamondstone, David, Members of random closed sets, to appear.
[5]Kjos-Hanssen, Bjørn, Merkle, Wolfgang, and Stephan, Frank, Kolmogorov complexity and the recursion theorem, arXiv 0901.3933 [math. LO]
[6]Kjos-Hanssen, Bjørn, Miller, Joseph S., and Solomon, Reed, Lowness notions, measure and domination.
[7]Kjos-Hanssen, Bjørn, Nies, André, and Stephan, Frank, Lowness for the class of Schnorr random reals, SIAM Journal on Computing, vol. 35 (2005), no. 3, pp. 647657 (electronic).
[8]Kurtz, Stewart, Randomness andgenericity in the degrees of unsolvability, Ph.D. thesis, University of Illinois at Urbana-Champaign, 1981.
[9]Nies, André, Lowness properties and randomness, Advances in Mathematics, vol. 197 (2005), no. 1. pp. 274305.
[10]Nies, André, Computability and randomness, Oxford University Press, 2009, in preparation.
[11]Nies, André, Stephan, Frank, and Terwijn, Sebastiaan A., Randomness, relativization and Turing degrees, this Journal, vol. 70 (2005), no. 2, pp. 515535.
[12]Nitzpon, Daniel, On ‘low for’: A few examples of lowness in recursion theory, Doctoraalexamen. University of Amsterdam, 2002.
[13]Simpson, Stephen and Cole, Joshua, Mass problems and hyperarithmeticity, Journal of Mathematical Logic, vol. 7 (2007), no. 2, pp. 125143.
[14]Slaman, Theodore A. and Solovay, Robert, When oracles do not help, COLT '91: Proceedings of the fourth annual workshop on Computational Learning Theory (Valiant, Leslie G. and Warmuth, Manfred K., editors), Morgan Kaufmann Publishers Inc., San Francisco. CA, USA. 1991, pp. 379383.
[15]Spector, Clifford, On degrees of recursive unsolvability, Annals of Mathematics, (2), vol. 64 (1956), pp. 581592.
[16]Stephan, Frank and Yu, Liang, Lowness for weakly 1-generic and Kurtz-random. Theory and applications of models of computation (Cai, Jin yi, Cooper, S. Barry, and Li, Angsheng, editors), Lecture Notes in Computer Science, vol. 3959, Springer, Berlin, 2006, pp. 756764.
[17]Terwijn, Sebastiaan A. and Zambella, Domenico, Computational randomness and lowness, this Journal, vol. 66 (2001), no. 3, pp. 11991205.
[18]Yu, Liang, Lowness for genericity, Archive for Mathematical Logic, vol. 45 (2006), no. 2, pp. 233238.
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: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed