Computational Complexity and Probability Constructions
- 1 April 1970
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 17 (2) , 241-259
- https://doi.org/10.1145/321574.321578
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- On the Length of Programs for Computing Finite Binary SequencesJournal of the ACM, 1969
- A Machine-Independent Theory of the Complexity of Recursive FunctionsJournal of the ACM, 1967
- The definition of random sequencesInformation and Control, 1966
- On the Length of Programs for Computing Finite Binary SequencesJournal of the ACM, 1966
- On the computational complexity of algorithmsTransactions of the American Mathematical Society, 1965
- A formal theory of inductive inference. Part IInformation and Control, 1964
- Classes of predictably computable functionsTransactions of the American Mathematical Society, 1963
- A Mathematical Theory of CommunicationBell System Technical Journal, 1948