Source: J. Symbolic Logic
Volume 73, Issue 3
We investigate the relationship between lowness for Schnorr randomness
and Schnorr triviality. We show that a real is low for Schnorr
randomness if and only if it is Schnorr trivial and hyperimmune free.
Full-text: Access denied (no subscription
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
Gregory J. Chaitin, A theory of program size formally identical to information theory, Journal of the Association for Computing Machinery, vol. 22 (1975), pp. 329--340.
Mathematical Reviews (MathSciNet): MR411829
Osvald Demuth, Remarks on the structure of tt-degrees based on constructive measure theory, Commentationes Mathematicae Universitatis Carolinae, vol. 29 (1988), no. 2, pp. 233--247.
Mathematical Reviews (MathSciNet): MR957390
Rod Downey, Evan Griffiths, and Geoffrey Laforte, On Schnorr and computable randomness, martingales, and machines, Mathematical Logic Quarterly, vol. 50 (2004), no. 6, pp. 613--627.
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.
Rodney G. Downey and Evan J. Griffiths, Schnorr randomness, Journal of Symbolic Logic, vol. 69 (2004), no. 2, pp. 533--554.
Johanna N. Y. Franklin, Schnorr trivial reals: A construction, Archive for Mathematical Logic, vol. 46 (2008), no. 7--8, pp. 665--678.
Johanna N. Y. Franklin and Frank Stephan, Schnorr trivial sets and truth-table reducibility, submitted.
Carl G. Jockusch, Jr., Relationships between reducibilities, Transactions of the American Mathematical Society, vol. 142 (1969), pp. 229--237.
Mathematical Reviews (MathSciNet): MR245439
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).
Joseph S. Miller and André Nies, Randomness and computability: Open questions, Bulletin of Symbolic Logic, vol. 12 (2006), no. 3, pp. 390--410.
André Nies, Lowness properties and randomness, Advances in Mathematics, vol. 197 (2005), no. 1, pp. 274--305.
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.
C.-P. Schnorr, A unified approach to the definition of random sequences, Mathematical Systems Theory. An International Journal on Mathematical Computing Theory, vol. 5 (1971), pp. 246--258.
Mathematical Reviews (MathSciNet): MR354328
Robert I. Soare, Recursively enumerable sets and degrees, Perspectives in Mathematical Logic, Springer-Verlag, 1987.
Mathematical Reviews (MathSciNet): MR882921
Sebastiaan A. Terwijn and Domenico Zambella, Computational randomness and lowness, Journal of Symbolic Logic, vol. 66 (2001), no. 3, pp. 1199--1205.