Computational randomness and lowness

Authors
Terwijn, SA Zambella, D
Citation
Sa. Terwijn et D. Zambella, Computational randomness and lowness, J SYMB LOG, 66(3), 2001, pp. 1199-1205
Citations number
11
Categorie Soggetti
Mathematics
Journal title
JOURNAL OF SYMBOLIC LOGIC
ISSN journal
00224812 → ACNP
Volume
66
Issue
3
Year of publication
2001
Pages
1199 - 1205
Database
ISI
SICI code
0022-4812(200109)66:3<1199:CRAL>2.0.ZU;2-O
Abstract
We prove that there are uncountably many sets that are low for the class of Schnorr random reals. We give a purely recursion theoretic characterizatio n of these sets and show that they all have Turing degree incomparable to 0 '. This contrasts with a result of Kucera and Terwijn [5] on sets that are low for the class of Martin-Lof random reals.