Source: J. Symbolic Logic
Volume 74, Issue 2
We prove that degrees that are low for Kurtz randomness cannot be diagonally non-recursive. Together with the work of Stephan and Yu , 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.
Rod Downey, Denis R. Hirschfeldt, André Nies, and Sebastiaan A. Terwijn, Calibrating randomness, Bulletin of Symbolic Logic, vol. 12 (2006), no. 3, pp. 411--491.
Rod Downey, André Nies, Rebecca Weber, and Liang Yu, Lowness and $\Pi\sp 0\sb 2$ nullsets, Journal of Symbolic Logic, vol. 71 (2006), no. 3, pp. 1044--1052.
Rodney G. Downey, Evan J. Griffiths, and Stephanie Reid, On Kurtz randomness, Theoretical Computer Science, vol. 321 (2004), no. 2-3, pp. 249--270.
Bjørn Kjos-Hanssen and David Diamondstone, Members of random closed sets, to appear.
Bjørn Kjos-Hanssen, Wolfgang Merkle, and Frank Stephan, Kolmogorov complexity and the recursion theorem, family arXiv 0901.3933 [math.LO].
Bjørn Kjos-Hanssen, Joseph S. Miller, and Reed Solomon, Lowness notions, measure and domination.
Bjørn Kjos-Hanssen, André Nies, and Frank Stephan, Lowness for the class of Schnorr random reals, SIAM Journal on Computing, vol. 35 (2005), no. 3, pp. 647--657 (electronic).
Stewart Kurtz, Randomness and genericity in the degrees of unsolvability, Ph.D. thesis, University of Illinois at Urbana-Champaign, 1981.
André Nies, Lowness properties and randomness, Advances in Mathematics, vol. 197 (2005), no. 1, pp. 274--305.
--------, Computability and randomness, Oxford University Press, 2009, in preparation.
André Nies, Frank Stephan, and Sebastiaan A. Terwijn, Randomness, relativization and Turing degrees, Journal of Symbolic Logic, vol. 70 (2005), no. 2, pp. 515--535.
Daniel Nitzpon, On `low for': A few examples of lowness in recursion theory, Doctoraalexamen, University of Amsterdam, 2002.
Stephen Simpson and Joshua Cole, Mass problems and hyperarithmeticity, Journal of Mathematical Logic, vol. 7 (2007), no. 2, pp. 125--143.
Theodore A. Slaman and Robert Solovay, When oracles do not help, COLT '91: Proceedings of the fourth annual workshop on Computational Learning Theory (Leslie G. Valiant and Manfred K. Warmuth, editors), Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 1991, pp. 379--383.
Clifford Spector, On degrees of recursive unsolvability, Annals of Mathematics. (2), vol. 64 (1956), pp. 581--592.
Mathematical Reviews (MathSciNet): MR82457
Frank Stephan and Liang Yu, Lowness for weakly 1-generic and Kurtz-random, Theory and applications of models of computation (Jin yi Cai, S. Barry Cooper, and Angsheng Li, editors), Lecture Notes in Computer Science, vol. 3959, Springer, Berlin, 2006, pp. 756--764.
Sebastiaan A. Terwijn and Domenico Zambella, Computational randomness and lowness, Journal of Symbolic Logic, vol. 66 (2001), no. 3, pp. 1199--1205.
Liang Yu, Lowness for genericity, Archive for Mathematical Logic, vol. 45 (2006), no. 2, pp. 233--238.