1. R. Beigel, M. Kummer, F. Stephan. Approximable sets. Information and Computation, 120:304–314, 1995.
2. H. Buhrman, E. Mayordomo. An excursion to the Kolmogorov random strings. In: Proceedings Structure in Complexity Theory, Tenth Annual Conference, pp. 197–203, 1995.
3. H. Buhrman, P. Orponen. Random strings make hard instances. In: Proceedings Structure in Complexity Theory, Ninth Annual Conference, pp. 217–222, 1994.
4. C. Calude. Information and randomness. Springer-Verlag, Berlin, 1994.
5. G. J. Chaitin. On the number of n-bit strings with maximum complexity. Applied Mathematics and Computation, 59:97–100, 1993.