A Theory of Program Size Formally Identical to Information Theory
- 1 July 1975
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 22 (3) , 329-340
- https://doi.org/10.1145/321892.321894
Abstract
No abstract availableThis publication has 14 references indexed in Scilit:
- Randomness and Mathematical ProofScientific American, 1975
- Universal codeword sets and representations of the integersIEEE Transactions on Information Theory, 1975
- Information-Theoretic Limitations of Formal SystemsJournal of the ACM, 1974
- On Determining the Irrationality of the Mean of a Random VariableThe Annals of Statistics, 1973
- The isomorphism problem in ergodic theoryBulletin of the American Mathematical Society, 1972
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMSRussian Mathematical Surveys, 1970
- Computational Complexity and Probability ConstructionsJournal of the ACM, 1970
- On the difficulty of computationsIEEE Transactions on Information Theory, 1970
- On the Length of Programs for Computing Finite Binary SequencesJournal of the ACM, 1969
- On the Length of Programs for Computing Finite Binary SequencesJournal of the ACM, 1966