Geodesic
Descriptive set theoretical complexity of randomness notions
Liang Yu1
1 Institute of Mathematical Science Nanjing University Nanjing 210093, P.R. China and The State Key Lab for Novel Software Technology Nanjing University Nanjing 210093, P.R. China
Fundamenta Mathematicae, Tome 215 (2011) no. 3, pp. 219-231 Cet article a éte moissonné depuis la source Institute of Mathematics Polish Academy of Sciences

Voir la notice de l'article

We study the descriptive set theoretical complexity of various randomness notions.
DOI : 10.4064/fm215-3-2
Keywords: study descriptive set theoretical complexity various randomness notions

Liang Yu 1

1 Institute of Mathematical Science Nanjing University Nanjing 210093, P.R. China and The State Key Lab for Novel Software Technology Nanjing University Nanjing 210093, P.R. China 
@article{10_4064_fm215_3_2,
     author = {Liang Yu},
     title = {Descriptive set theoretical complexity of randomness notions},
     journal = {Fundamenta Mathematicae},
     pages = {219--231},
     year = {2011},
     volume = {215},
     number = {3},
     doi = {10.4064/fm215-3-2},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.4064/fm215-3-2/}
}
TY  - JOUR
AU  - Liang Yu
TI  - Descriptive set theoretical complexity of randomness notions
JO  - Fundamenta Mathematicae
PY  - 2011
SP  - 219
EP  - 231
VL  - 215
IS  - 3
UR  - http://geodesic.mathdoc.fr/articles/10.4064/fm215-3-2/
DO  - 10.4064/fm215-3-2
LA  - en
ID  - 10_4064_fm215_3_2
ER  - 
%0 Journal Article
%A Liang Yu
%T Descriptive set theoretical complexity of randomness notions
%J Fundamenta Mathematicae
%D 2011
%P 219-231
%V 215
%N 3
%U http://geodesic.mathdoc.fr/articles/10.4064/fm215-3-2/
%R 10.4064/fm215-3-2
%G en
%F 10_4064_fm215_3_2
Liang Yu. Descriptive set theoretical complexity of randomness notions. Fundamenta Mathematicae, Tome 215 (2011) no. 3, pp. 219-231. doi: 10.4064/fm215-3-2

Cité par Sources :