You are not currently logged in.
Access JSTOR 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.
Rod Downey, Andre Nies, Rebecca Weber and Liang Yu
The Journal of Symbolic Logic
Vol. 71, No. 3 (Sep., 2006), pp. 1044-1052
Published by: Association for Symbolic Logic
Stable URL: http://www.jstor.org/stable/27588495
Page Count: 9
You can always find the topics here!Topics: Randomness, String, Degree of unsolvability, Minimal pairs, Oracles, College mathematics
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
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 exists a noncomputable c.e. real which is low for weak 2-randomness, a definition of randomness due to Kurtz, and that all reals which are low for weak 2-randomness are low for Martin-Löf randomness.
The Journal of Symbolic Logic © 2006 Association for Symbolic Logic