On the difficulty of computations
- 1 January 1970
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 16 (1) , 5-9
- https://doi.org/10.1109/tit.1970.1054390
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- On the Simplicity and Speed of Programs for Computing Infinite Sets of Natural NumbersJournal of the ACM, 1969
- Toward a Theory of EnumerationsJournal of the ACM, 1969
- On the Length of Programs for Computing Finite Binary SequencesJournal of the ACM, 1969
- Logical basis for information theory and probability theoryIEEE Transactions on Information Theory, 1968
- 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
- Machine dependence of degrees of difficultyProceedings of the American Mathematical Society, 1965
- A formal theory of inductive inference. Part IInformation and Control, 1964
- Applications of recursive function theory to number theoryPublished by American Mathematical Society (AMS) ,1962