Descriptive set theoretical complexity of randomness notions

We study the descriptive set theoretical complexity of various randomness

[1]  André Nies,et al.  Randomness notions and partial relativization , 2012 .

[2]  Jack H. Lutz,et al.  The arithmetical complexity of dimension and randomness , 2007, TOCL.

[3]  Liang Yu,et al.  On initial segment complexity and degrees of randomness , 2008 .

[4]  F. Stephan,et al.  Set theory , 2018, Mathematical Statistics with Applications in R.

[5]  André Nies,et al.  Randomness, relativization and Turing degrees , 2005, J. Symb. Log..

[6]  Joseph S. Miller,et al.  Every 2-random real is Kolmogorov random , 2004, Journal of Symbolic Logic.

[7]  A. Nies.  Computability and randomness , 2009 .

[8]  Rodney G. Downey,et al.  Algorithmic Randomness and Complexity , 2010, Theory and Applications of Computability.

[9]  G. Sacks.  Higher recursion theory , 1990 .

[10]  Joseph S. Miller,et al.  The K-Degrees, Low for K Degrees, and Weakly Low for K Sets , 2009, Notre Dame J. Formal Log..

[11]  A. Nies,et al.  Lowness of higher randomness notions , 2008 .

[12]  Lowness and Π 0 2 Nullsets , 2006 .