1. Gács, P.: Lecture notes on descriptional complexity and randomness (manuscript), http://www.cs.bu.edu/fac/gacs/recent-publ.html
2. Gács, P., Hoyrup, M., Rojas, C.: Randomness on computable probability spaces - a dynamical point of view. In: Symposium on Theoretical Aspects of Computer Science (STACS 2009). Dagstuhl Seminar Proceedings. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, vol. 9001, pp. 469–480 (2009)
3. Lecture Notes in Computer Science;M. Hoyrup,2009
4. Hoyrup, M., Rojas, C.: Computability of probability measures and Martin-Löf randomness over metric spaces. Information and Computation 207(7), 2207–2222 (2009)
5. Kučera, A.: Measure, $\Pi^0_1$ classes, and complete extensions of PA. In: Ebbinghaus, H.-D., Müller, G.H., Sacks, G.E. (eds.) Recursion Theory Week. Proceedings of a Conference held in Oberwolfach, West Germany, April 15-21. LNM, vol. 1141, pp. 245–259 (1985)