Active Bibliography

25 Some Computability-Theoretical Aspects of Reals and Randomness – Rodney G. Downey - 2001
11 Complexity and Randomness – Sebastiaan A. Terwijn - 2003
5 The Kolmogorov Complexity of Random Reals – Liang Yu, Decheng Ding, Nanjing Jiang Su, Rodney Downey - 2003
79 Lowness Properties and Randomness – André Nies
21 Relativizing Chaitin’s halting probability – Rod Downey, Denis R. Hirschfeldt, Joseph S. Miller, André Nies
The Classes of Algorithmically Random Reals – Stephanie Reid - 2003
13 Computability and Measure – Sebastiaan Augustinus Terwijn - 1998
2 Interactions of Computability and Randomness – André Nies
32 On initial segment complexity and degrees of randomness – Joseph S. Miller, Liang Yu
Computability Theory, Algorithmic Randomness and Turing’s Anticipation – Rod Downey
38 Randomness, relativization, and Turing degrees – Andre Nies, Frank Stephan, Sebastiaan A. Terwijn - 2005
2 Kolmogorov complexity and computably enumerable sets – George Barmpalias, Angsheng Li - 2011
22 An extension of the recursively enumerable Turing degrees – Stephen G. Simpson - 2006
2 Algorithmic Randomness and Computability – Rod Downey
5 Lowness and Π0 2 nullsets – Rod Downey, Andre Nies, Rebecca Weber, Liang Yu - 2006
7 Five Lectures on Algorithmic Randomness – Rod Downey - 2007
1 Computability and randomness: Five questions – André Nies
2 Relative Randomness via RK-Reducibility – Alexander Raichev, Wendell Berry - 2006
34 Recursively Enumerable Reals and Chaitin Ω Numbers – Cristian S. Calude, Peter H. Hertling, Bakhadyr Khoussainov, Yongge Wang