Computational Randomness and Lowness
Terwijn, Sebastiaan A. ; Zambella, Domenico
J. Symbolic Logic, Tome 66 (2001) no. 1, p. 1199-1205 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
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 Kucera and Terwijn [5] on sets that are low for the class of Martin-Lof random reals.
Publié le : 2001-09-14
Classification:  
@article{1183746554,
     author = {Terwijn, Sebastiaan A. and Zambella, Domenico},
     title = {Computational Randomness and Lowness},
     journal = {J. Symbolic Logic},
     volume = {66},
     number = {1},
     year = {2001},
     pages = { 1199-1205},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1183746554}
}

Terwijn, Sebastiaan A.; Zambella, Domenico. Computational Randomness and Lowness. J. Symbolic Logic, Tome 66 (2001) no. 1, pp.  1199-1205. http://gdmltest.u-ga.fr/item/1183746554/