You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Computational Randomness and Lowness
Sebastiaan A. Terwijn and Domenico Zambella
The Journal of Symbolic Logic
Vol. 66, No. 3 (Sep., 2001), pp. 1199-1205
Published by: Association for Symbolic Logic
Stable URL: http://www.jstor.org/stable/2695101
Page Count: 7
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
We prove that there are uncountably many sets that are low for the class of Schnorr random reals. We give a purely recursion theoretic characterization of these sets and show that they all have Turing degree incomparable to 0'. This contrasts with a result of Kučera and Terwijn  on sets that are low for the class of Martin-Löf random reals.
The Journal of Symbolic Logic © 2001 Association for Symbolic Logic