Lowness for Kurtz randomness
Noam Greenberg and Joseph S. Miller
Source: J. Symbolic Logic Volume 74, Issue 2
(2009), 665-678.
Abstract
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.
First Page:
Show
Hide
Full-text: Access denied (no subscription
detected)
We're sorry, but we are unable to provide
you with the full text of this article because we are not able to identify
you as a subscriber.
If you have a personal subscription to
this journal, then please login. If you are already logged in, then you
may need to update your profile to register your subscription. Read more about accessing full-text
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.jsl/1243948333
Digital Object Identifier: doi:10.2178/jsl/1243948333
Zentralblatt MATH identifier: 05561772
Mathematical Reviews number (MathSciNet): MR2518817
References
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.
Mathematical Reviews (MathSciNet): MR2248591
Digital Object Identifier: doi:10.2178/bsl/1154698741
Project Euclid: euclid.bsl/1154698741
Zentralblatt MATH: 1113.03037
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.
Mathematical Reviews (MathSciNet): MR2251554
Digital Object Identifier: doi:10.2178/jsl/1154698590
Project Euclid: euclid.jsl/1154698590
Zentralblatt MATH: 1112.03040
Rodney G. Downey, Evan J. Griffiths, and Stephanie Reid, On Kurtz randomness, Theoretical Computer Science, vol. 321 (2004), no. 2-3, pp. 249--270.
Mathematical Reviews (MathSciNet): MR2076147
Digital Object Identifier: doi:10.1016/j.tcs.2004.03.055
Zentralblatt MATH: 1070.68054
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).
Mathematical Reviews (MathSciNet): MR2201451
Digital Object Identifier: doi:10.1137/S0097539704446323
Zentralblatt MATH: 1095.68043
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.
Mathematical Reviews (MathSciNet): MR2166184
Digital Object Identifier: doi:10.1016/j.aim.2004.10.006
Zentralblatt MATH: 1141.03017
--------, Computability and randomness, Oxford University Press, 2009, in preparation.
Mathematical Reviews (MathSciNet): MR2548883
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.
Mathematical Reviews (MathSciNet): MR2140044
Digital Object Identifier: doi:10.2178/jsl/1120224726
Project Euclid: euclid.jsl/1120224726
Zentralblatt MATH: 1090.03013
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.
Mathematical Reviews (MathSciNet): MR2423947
Digital Object Identifier: doi:10.1142/S0219061307000652
Zentralblatt MATH: 1150.03013
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
Digital Object Identifier: doi:10.2307/1969604
JSTOR: links.jstor.org
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.
Mathematical Reviews (MathSciNet): MR2279138
Digital Object Identifier: doi:10.1007/11750321_72
Zentralblatt MATH: 1178.03052
Sebastiaan A. Terwijn and Domenico Zambella, Computational randomness and lowness, Journal of Symbolic Logic, vol. 66 (2001), no. 3, pp. 1199--1205.
Mathematical Reviews (MathSciNet): MR1856736
Digital Object Identifier: doi:10.2307/2695101
JSTOR: links.jstor.org
Zentralblatt MATH: 0990.03033
Liang Yu, Lowness for genericity, Archive for Mathematical Logic, vol. 45 (2006), no. 2, pp. 233--238.
Mathematical Reviews (MathSciNet): MR2209745
Digital Object Identifier: doi:10.1007/s00153-005-0306-y
Zentralblatt MATH: 1148.03033
