Becher, V., Figueira, S., Nies, A., and Picchi, S., Program size complexity for possibly infinite computations, Notre Dame Journal of Formal Logic, vol. 46 (2005), pp. 51–64.
Chaitin, G. J., On the length of programs for computing finite binary sequences, Journal of the ACM, vol. 13 (1966), pp. 547–569.
Chaitin, G. J., On the length of programs for computing finite binary sequences: statistical considerations, Journal of the ACM, vol. 16 (1969), pp. 145–159.
Chaitin, G. J., A theory of program size formally identical to information theory, Journal of the ACM, vol. 22 (1975), pp. 329–340.
Csima, B. F. and Montalbán, A., A minimal pair of K-degrees, Proceedings of the American Mathematical Society, vol. 134 (2006), pp. 1499–1502.
Downey, R. G. and Hirschfeldt, D. R., Algorithmic randomness and complexity, Springer-Verlag, to appear.
Downey, R. G., Hirschfeldt, D. R., and LaForte, G., Randomness and reducibility, Mathematical Foundations of Computer Science 2001 (Sgall, J., Pultr, A., and Kolman, P., editors), Lecture Notes in Computer Science, vol. 2136, Springer-Verlag, 2003, pp. 316–327.
Downey, R. G., Hirschfeldt, D. R., and Nies, A., Randomness, computability and density, SIAM Journal on Computing, vol. 31 (2002), pp. 1169–1183.
Downey, R. G, Hirschfeldt, D. R., Nies, A., and Stephan, F., Trivial reals. Proceedings of Asian Logic Conferences (Downey, R. G.et al., editors), World Scientific, 2003, pp. 103–131.
Gács, P., On the symmetry of algorithmic information, Soviet Mathematics Doklady, vol. 15 (1974), pp. 1477–1480.
Kolmogorov, A. N., Three approaches to the quantitative definition of information, Problems of Information Transmission, vol. 1 (1965), pp. 1–7.
Kummer, M., Kolmogorov complexity and instance complexity of recursively enumerable sets, SIAM Journal on Computing, vol. 25 (1996), pp. 1123–1143.
Levin, L. A., On the notion of a random sequence, Soviet Mathematics Doklady, vol. 14 (1973), pp. 1413–1416.
Levin, L. A., Laws of information conservation (non-growth) and aspects of the foundation of probability theory, Problems of Information Transmission, vol. 10 (1974), pp. 206–210.
Li, M. and Vitányi, P., An introduction to Kolmogorov complexity and its applications, 2nd ed., Springer-Verlag, 1997.
Loveland, D. W., A variant of the Kolmogorov concept of complexity, Information and Control, vol. 15 (1969), pp. 510–526.
Miller, J. S., Every 2-random real is Kolmogorov random, this Journal, vol. 69 (2004), pp. 907–913.
Miller, J. S. and Yu, L., On initial segment complexity and degrees of randomness, Transaction of the American Mathematical Society, to appear.
Nies, A., Lowness properties and randomness, Advances in Mathematics, vol. 197 (2005), pp. 274–305.
Nies, A., Stephan, F., and Terwijn, S., Randomness, relativization and turing degrees, this Journal, vol. 70 (2005), pp. 515–535.
Sacks, G. E., The recursively enumerable degrees are dense, Annals of Mathematics, vol. 80 (1964), pp. 300–312.
Schnorr, C. P., Process complexity and effective random tests, Journal of Computer and System Sciences, vol. 7 (1973), pp. 376–388.
Schnorr, C. P., A survey of the theory of random sequences, Basic problems in methodology and linguistics (Butts, R. E. and Hintikka, J., editors), D. Reidel, 1977, pp. 193–210.
Solomonoff, R. J., A formal theory of inductive inference, part 1 and part 2, Information and Control, vol. 7 (1964), pp. 1–22 and 224–254.
Solovay, R. M., Draft of a paper (or series of papers) on Chaitin's work, Unpublished manuscript, 1975, IBM Thomas J. Watson Research Center, NY.
Uspensky, V. A. and Shen, A., Relations between varieties of Kolmogorov complexities, Mathematical Systems Theory, vol. 29 (1996), pp. 271–292.