Author:
Greenberg Noam,Miller Joseph S.
Abstract
AbstractWe 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.
Publisher
Cambridge University Press (CUP)
Reference18 articles.
1. Mass problems and hyperarithmeticity;Simpson;Journal of Mathematical Logic,2007
2. Nitzpon Daniel , On ‘low for’: A few examples of lowness in recursion theory, Doctoraalexamen. University of Amsterdam, 2002.
3. Computability and Randomness
4. Lowness for the Class of Schnorr Random Reals
5. Kjos-Hanssen Bjørn , Miller Joseph S. , and Solomon Reed , Lowness notions, measure and domination.
Cited by
26 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献