1. Constructive equivalence relations on computable probability measures;Bienvenu;Lecture Notes in Computer Science,2006
2. Downey, R., and D. Hirschfeldt, “Algorithmic Randomness and Complexity”, Manuscript, 2003
3. Gacs, P., “Lecture Notes on Descriptional Complexity and Randomness”, Boston University, 1988
4. Kurtz, S., “Randomness and genericity in the degrees of unsolvability”, PhD thesis, University of Illinois at Urbana, 1981
5. The definition of random sequences;Martin-Löf;Information and Control,1966