Relations between varieties of kolmogorov complexities
- 1 June 1996
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 29 (3) , 271-292
- https://doi.org/10.1007/bf01201280
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- An Introduction to Kolmogorov Complexity and Its ApplicationsPublished by Springer Nature ,1993
- Gregory J. Chaitin, Algorithmic information theory, Cambridge tracts in theoretical computer science, no. 1. Cambridge University Press, Cambridge etc. 1987, xi + 175 pp.The Journal of Symbolic Logic, 1989
- Information, Randomness & IncompletenessPublished by World Scientific Pub Co Pte Ltd ,1987
- Algorithmic Information TheoryPublished by Cambridge University Press (CUP) ,1987
- On the relation between descriptional complexity and algorithmic probabilityTheoretical Computer Science, 1983
- A Theory of Program Size Formally Identical to Information TheoryJournal of the ACM, 1975
- Process complexity and effective random testsJournal of Computer and System Sciences, 1973
- A variant of the Kolmogorov concept of complexityInformation and Control, 1969
- 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