Descriptive set theoretical complexity of randomness notions
Liang Yu
Fundamenta Mathematicae, Tome 215 (2011), p. 219-231 / Harvested from The Polish Digital Mathematics Library
Access to full text
Full (PDF)

We study the descriptive set theoretical complexity of various randomness notions.

Publié le : 2011-01-01
EUDML-ID : urn:eudml:doc:283194 
@article{bwmeta1.element.bwnjournal-article-doi-10_4064-fm215-3-2,
     author = {Liang Yu},
     title = {Descriptive set theoretical complexity of randomness notions},
     journal = {Fundamenta Mathematicae},
     volume = {215},
     year = {2011},
     pages = {219-231},
     zbl = {1258.03063},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-fm215-3-2}
}

Liang Yu. Descriptive set theoretical complexity of randomness notions. Fundamenta Mathematicae, Tome 215 (2011) pp. 219-231. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_4064-fm215-3-2/