Selected papers that cite this one
- Manuel Blum. On the size of machines. Information and Control, 11(3):257-265, September 1967.
- Cristian S. Calude, Peter H. Hertling, Bakhadyr Khoussainov, and Yongge Wang. Recursively enumerable reals and Chaitin Omega numbers. In 15th Annual Symposium on Theoretical Aspects of Computer Science, volume 1373 of Lecture Notes in Computer Science, pages 596-606, Paris France, 25-27 February 1998. Springer.
- Gregory J. Chaitin. On the length of programs for computing finite binary sequences: Statistical considerations. Journal of the ACM, 16(1):145-159, January 1969.
- Gregory J. Chaitin. On the simplicity and speed of programs for computing infinite sets of natural numbers. Journal of the ACM, 16(3):407-422, July 1969.
- Robert P. Daley. An example of information and computation resource trade-off. Journal of the ACM, 20(4):687-695, October 1973.
- David W. Juedes and Jack H. Lutz. Completeness and weak completeness under polynomial-size circuits. Information and Computation, 125(1):13-31, 25 February 1996.
- D. W. Loveland. On minimal-program complexity measures. In Conference Record of ACM Symposium on Theory of Computing, pages 61-65, Marina del Rey, California, 5-7 May 1969.
- Martin Mundhenk and Rainer Schuler. Random languages for nonuniform complexity classes. Journal of Complexity, 7(3):296-310, September 1991.
- Robert A. Di Paola. Random sets in subrecursive hierarchies. Journal of the ACM, 16(4):621-630, October 1969.
- J. Rissanen. Stochastic complexity in learning. Journal of Computer and System Sciences, 55(1):89-95, August 1997.
- Aaron Shenhar. On the Kolmogorov complexity of arbitrary objects. Journal of Complexity, 9(4):499-517, December 1993.
- Ray J. Solomonoff. The discovery of algorithmic probability. Journal of Computer and System Sciences, 55(1):73-88, August 1997.
- Ludwig Staiger. Kolgomorov complexity and Hausdorff dimension. Information and Computation, 103(2):159-194, April 1993.
- J. P. R. Tootill, W. D. Robinson, and D. J. Eagle. An asymptotically random Tausworthe sequence. Journal of the ACM, 20(3):469-481, July 1973.
- V. A. Uspensky and A. Shen. Relations between varieties of Kolmogorov complexities. Mathematical Systems Theory, 29(3):271-292, May/June 1996.
- David G. Willis. Computational complexity and probability constructions. Journal of the ACM, 17(2):241-259, April 1970.