Kucera, Antonín; Slaman, T. Randomness and recursive enumerability. (English) Zbl 0992.68079 SIAM J. Comput. 31, No. 1, 199-211 (2001). Cited in 3 ReviewsCited in 46 Documents MSC: 68Q30 Algorithmic information theory (Kolmogorov complexity, etc.) 03D15 Complexity of computation (including implicit computational complexity) Keywords:random real; Chaitin; Kolmogorov; \(\Omega\)-number PDF BibTeX XML Cite \textit{A. Kucera} and \textit{T. Slaman}, SIAM J. Comput. 31, No. 1, 199--211 (2001; Zbl 0992.68079) Full Text: DOI