Ambos-Spies, K. and Kučera, A., Randomness in computability theory, Computability theory and its applications (Cholak, Lempp, , Lerman, , and Shore, , editors). Contemporary Mathematics, vol. 257, American Mathematical Society, 2000, pp. 1–14.
Ambos-Spies, K. and Mayordomo, E., Resource bounded measure and randomness, Complexity, logic and recursion theory (Sorbi, A., editor), Marcel-Decker, New York, 1997, pp. 1–48.
Chaitin, G., A theory of program size formally identical to information theory, Journal of the ACM, vol. 22 (1975), pp. 329–340.
Downey, R., Griffiths, E., and LaForte, G., On Schnorr and computable randomness, martingales, and machines, Mathematical Logic Quarterly, to appear.
Downey, R., Hirschfeldt, D., Nies, A., and Stephan, F., Trivial reals, extended abstract in Computability and Complexity in Analysis, Malaga, Electronic Notes in Theoretical Computer Science, and proceedings, edited by Brattka, , Schröder, , Weihrauch, , FernUniversität Hagen, 294-6/2002, pp. 37–55, 07, 2002. Final version appears in Proceedings of the 7th and 8th Asian Logic Conferences (Rod Downey, Ding Decheng, Tung Shi Ping, Qiu Yu Hui, Mariko Yasugi, and Wu Guohua, editors) World Scientific, 2003, pp. 103–131.
Kolmogorov, A. N., Three approaches to the quantitative definition of information, Problems of Information Transmission (Problemy Peredachi Informatsii), vol. 1 (1965), pp. 1–7.
Kučera, A., Measure, -classes and complete extensions of PA, Recursion theory week (Ebbinghaus, H.-D., Müller, G. H., and Sacks, G. E., editors), Lecture Notes in Mathematics, vol. 1141, Springer-Verlag, Berlin, Heidelberg, New York, 1985, pp. 245–259.
Kučera, A. and Slaman, T., Randomness and recursive enumerability, SI AM Journal on Computing, vol. 31 (2001), pp. 199–211.
van Lambalgen, M., Random sequences, Ph.D. thesis, University of Amsterdam, 1987.
Levin, L., Measures of complexity of finite objects (axiomatic description), Soviet Mathematics Doklady, vol. 17 (1976), pp. 522–526.
Li, M. and Vitanyi, P., An introduction to Kolmogorov complexity and its applications, 2nd ed., Springer-Verlag, New York, 1997.
Lutz, J. H., Almost everywhere high nonuniform complexity, Journal of Computer and System Sciences, vol. 44 (1992), pp. 220–258.
Martin-Löf, P., The definition of random sequences, Information and Control, vol. 9 (1966), pp. 602–619.
Nies, A., Lowness properties and randomness, to appear.
Schnorr, C. P., Zufälligkeit und Wahrscheinlichkeit, Lecture Notes in Mathematics, vol. 218, Springer-Verlag, Berlin, New York, 1971.
Schnorr, C. P., Process complexity and effective random tests, Journal of Computer and System Sciences, vol. 7 (1973), pp. 376–388.
Solomonof, R., A formal theory of inductive inference, Part I, Information and Control, vol. 7 (1964), pp. 1–22.
Solovay, R., Draft of paper (or series of papers) on Chaitin's work. Unpublished, 215 pages, 05 1975.
Terwijn, A. and Zambella, D., Computational randomness and lowness, this Journal, vol. 66 (2001), pp. 1199–1205.
Wang, Y., Randomness and complexity, Ph.D. thesis, University of Heidelberg, 1996.