Journal of the ACM Bibliography

Additional Key Words and Phrases: computational complexity, computable set, recursive set, Turing machine, constructive ordinal, partially ordered set, lattice

Selected papers that cite this one

• Manuel Blum. On the size of machines. Information and Control, 11(3):257-265, September 1967.

• J. Rissanen. Stochastic complexity in learning. Journal of Computer and System Sciences, 55(1):89-95, August 1997.

• Ray J. Solomonoff. The discovery of algorithmic probability. Journal of Computer and System Sciences, 55(1):73-88, August 1997.

Selected references

• Manuel Blum. A machine-independent theory of the complexity of recursive functions. Journal of the ACM, 14(2):322-336, April 1967.

• Manuel Blum. On the size of machines. Information and Control, 11(3):257-265, September 1967.

• 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 length of programs for computing finite binary sequences. Journal of the ACM, 13(4):547-569, October 1966.

• R. J. Solomonoff. A formal theory of inductive inference. part I. Information and Control, 7(1):1-22, March 1964.

Shortcuts: