### Subclasses of the Weakly Random Reals

Johanna N. Y. Franklin
Source: Notre Dame J. Formal Logic Volume 51, Number 4 (2010), 417-426.

#### Abstract

The weakly random reals contain not only the Schnorr random reals as a subclass but also the weakly 1-generic reals and therefore the n-generic reals for every n. While the class of Schnorr random reals does not overlap with any of these classes of generic reals, their degrees may. In this paper, we describe the extent to which this is possible for the Turing, weak truth-table, and truth-table degrees and then extend our analysis to the Schnorr random and hyperimmune reals.

First Page:
Primary Subjects: 03D32
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.

Permanent link to this document: http://projecteuclid.org/euclid.ndjfl/1285765796
Digital Object Identifier: doi:10.1215/00294527-2010-026
Zentralblatt MATH identifier: 05822354
Mathematical Reviews number (MathSciNet): MR2741834

### References

[1] Demuth, O., and A. Kučera, "Remarks on $1$-genericity, semigenericity and related concepts", Commentationes Mathematicae Universitatis Carolinae, vol. 28 (1987), pp. 85--94.
Mathematical Reviews (MathSciNet): MR889770
Zentralblatt MATH: 0655.03029
[2] Downey, R. G., and E. J. Griffiths, "Schnorr randomness", The Journal of Symbolic Logic, vol. 69 (2004), pp. 533--54.
Mathematical Reviews (MathSciNet): MR2058188
Zentralblatt MATH: 1072.03025
Digital Object Identifier: doi:10.2178/jsl/1082418542
Project Euclid: euclid.jsl/1082418542
[3] Downey, R. G., and D. R. Hirschfeldt, Algorithmic Randomness and Complexity, Springer-Verlag, New York, 2010.
[4] Franklin, J. N. Y., "Schnorr triviality and genericity", The Journal of Symbolic Logic, vol. 75 (2010), pp. 191--207.
Mathematical Reviews (MathSciNet): MR2605888
Zentralblatt MATH: 1184.03040
Digital Object Identifier: doi:10.2178/jsl/1264433915
Project Euclid: euclid.jsl/1264433915
[5] Gács, P., "Every sequence is reducible to a random one", Information and Control, vol. 70 (1986), pp. 186--92.
Mathematical Reviews (MathSciNet): MR859105
Zentralblatt MATH: 0628.03024
Digital Object Identifier: doi:10.1016/S0019-9958(86)80004-3
[6] Jockusch, C. G., Jr., "Degrees of generic sets", pp. 110--39 in Recursion Theory: Its Generalisation and Applications (Proceedings of the Logic Colloquium, Leeds, 1979), vol. 45 of London Mathematical Society Lecture Note Series, Cambridge University Press, Cambridge, 1980.
Mathematical Reviews (MathSciNet): MR598304
Zentralblatt MATH: 0457.03042
[7] Kautz, S. M., Degrees of Random Sets, Ph.D. thesis, Cornell University, Ithaca, 1991.
Mathematical Reviews (MathSciNet): MR2686787
[8] Kjos-Hanssen, B., W. Merkle, and F. Stephan, "Kolmogorov complexity and the recursion theorem", pp. 149--61 in STACS 2006, vol. 3884 of Lecture Notes in Computer Science, Springer, Berlin, 2006.
Mathematical Reviews (MathSciNet): MR2249365
Zentralblatt MATH: 1137.03026
[9] Kučera, A., "Measure, $\Pi^0_1$-classes and complete extensions of ${\rm PA}$", pp. 245--59 in Recursion Theory Week (Oberwolfach, 1984), vol. 1141 of Lecture Notes in Mathematics, Springer, Berlin, 1985.
Mathematical Reviews (MathSciNet): MR820784
Zentralblatt MATH: 0622.03031
[10] Kučera, A., "Randomness and generalizations of fixed point free functions", pp. 245--54 in Recursion Theory Week (Oberwolfach, 1989), vol. 1432 of Lecture Notes in Mathematics, Springer, Berlin, 1990.
Mathematical Reviews (MathSciNet): MR1071521
Zentralblatt MATH: 0705.03021
[11] Kurtz, S. A., Randomness and Genericity in the Degrees of Unsolvability, Ph.D. thesis, University of Illinois, Urbana-Champaign, 1981.
Mathematical Reviews (MathSciNet): MR2631709
[12] Martin-Löf, P., "The definition of random sequences", Information and Computation, vol. 9 (1966), pp. 602--19.
Mathematical Reviews (MathSciNet): MR0223179
Zentralblatt MATH: 0244.62008
[13] Nies, A., F. Stephan, and S. A. Terwijn, "Randomness, relativization and Turing degrees", The Journal of Symbolic Logic, vol. 70 (2005), pp. 515--35.
Mathematical Reviews (MathSciNet): MR2140044
Zentralblatt MATH: 1090.03013
Digital Object Identifier: doi:10.2178/jsl/1120224726
Project Euclid: euclid.jsl/1120224726
[14] Odifreddi, P. G., Classical Recursion Theory. Vol. II, vol. 143 of Studies in Logic and the Foundations of Mathematics, North-Holland Publishing Co., Amsterdam, 1999.
Mathematical Reviews (MathSciNet): MR1718169
Zentralblatt MATH: 0931.03057
[15] Odifreddi, P., Classical Recursion Theory. The Theory of Functions and Sets of Natural Numbers, vol. 125 of Studies in Logic and the Foundations of Mathematics, North-Holland Publishing Co., Amsterdam, 1989.
Mathematical Reviews (MathSciNet): MR982269
Zentralblatt MATH: 0661.03029
[16] Schnorr, C.-P., Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie, vol. 218 of Lecture Notes in Mathematics, Springer-Verlag, Berlin, 1971.
Mathematical Reviews (MathSciNet): MR0414225
Zentralblatt MATH: 0232.60001
[17] Soare, R. I., Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets, Perspectives in Mathematical Logic. Springer-Verlag, Berlin, 1987.
Mathematical Reviews (MathSciNet): MR882921
Zentralblatt MATH: 0667.03030
[18] Solovay, R. M., "A model of set-theory in which every set of reals is Lebesgue measurable", Annals of Mathematics. Second Series, vol. 92 (1970), pp. 1--56.
Mathematical Reviews (MathSciNet): MR0265151
Zentralblatt MATH: 0207.00905
Digital Object Identifier: doi:10.2307/1970696
[19] Wang, Y., Randomness and Complexity, Ph.D. thesis, University of Heidelberg, Heidelberg, 1996.