How Incomputable Is Kolmogorov Complexity? - PubMed (original) (raw)
Review
How Incomputable Is Kolmogorov Complexity?
Paul M B Vitányi. Entropy (Basel). 2020.
Abstract
Kolmogorov complexity is the length of the ultimately compressed version of a file (i.e., anything which can be put in a computer). Formally, it is the length of a shortest program from which the file can be reconstructed. We discuss the incomputability of Kolmogorov complexity, which formal loopholes this leaves us with, recent approaches to compute or approximate Kolmogorov complexity, which approaches are problematic, and which approaches are viable.
Keywords: Kolmogorov complexity; feasibility; incomputability.
Conflict of interest statement
The author declares no conflict of interest.
Similar articles
- An Additively Optimal Interpreter for Approximating Kolmogorov Prefix Complexity.
Leyva-Acosta Z, Acuña Yeomans E, Hernandez-Quiroz F. Leyva-Acosta Z, et al. Entropy (Basel). 2024 Sep 20;26(9):802. doi: 10.3390/e26090802. Entropy (Basel). 2024. PMID: 39330135 Free PMC article. - Fuzzy Kolmogorov Complexity Based on a Classical Description.
Dai S. Dai S. Entropy (Basel). 2020 Jan 4;22(1):66. doi: 10.3390/e22010066. Entropy (Basel). 2020. PMID: 33285841 Free PMC article. - Approximate entropy (ApEn) as a complexity measure.
Pincus S. Pincus S. Chaos. 1995 Mar;5(1):110-117. doi: 10.1063/1.166092. Chaos. 1995. PMID: 12780163 - Methods of information theory and algorithmic complexity for network biology.
Zenil H, Kiani NA, Tegnér J. Zenil H, et al. Semin Cell Dev Biol. 2016 Mar;51:32-43. doi: 10.1016/j.semcdb.2016.01.011. Epub 2016 Jan 21. Semin Cell Dev Biol. 2016. PMID: 26802516 Review. - Entropy for the Complexity of Physiological Signal Dynamics.
Zhang XD. Zhang XD. Adv Exp Med Biol. 2017;1028:39-53. doi: 10.1007/978-981-10-6041-0_3. Adv Exp Med Biol. 2017. PMID: 29058215 Review.
Cited by
- Computational Creativity and Aesthetics with Algorithmic Information Theory.
Mondol T, Brown DG. Mondol T, et al. Entropy (Basel). 2021 Dec 8;23(12):1654. doi: 10.3390/e23121654. Entropy (Basel). 2021. PMID: 34945960 Free PMC article. - An Additively Optimal Interpreter for Approximating Kolmogorov Prefix Complexity.
Leyva-Acosta Z, Acuña Yeomans E, Hernandez-Quiroz F. Leyva-Acosta Z, et al. Entropy (Basel). 2024 Sep 20;26(9):802. doi: 10.3390/e26090802. Entropy (Basel). 2024. PMID: 39330135 Free PMC article. - Consistent Quantification of Complex Dynamics via a Novel Statistical Complexity Measure.
Keul F, Hamacher K. Keul F, et al. Entropy (Basel). 2022 Apr 4;24(4):505. doi: 10.3390/e24040505. Entropy (Basel). 2022. PMID: 35455168 Free PMC article. - Kolmogorov Basic Graphs and Their Application in Network Complexity Analysis.
Farzaneh A, Coon JP, Badiu MA. Farzaneh A, et al. Entropy (Basel). 2021 Nov 29;23(12):1604. doi: 10.3390/e23121604. Entropy (Basel). 2021. PMID: 34945910 Free PMC article. - Information Theory Opens New Dimensions in Experimental Studies of Animal Behaviour and Communication.
Reznikova Z. Reznikova Z. Animals (Basel). 2023 Mar 26;13(7):1174. doi: 10.3390/ani13071174. Animals (Basel). 2023. PMID: 37048430 Free PMC article. Review.
References
- Kolmogorov A.N. Three approaches to the quantitative definition of information. Probl. Inform. Transm. 1965;1:1–7. doi: 10.1080/00207166808803030. - DOI
- Li M., Vitányi P.M.B. An Introduction to Kolmogorov Complexity and Its Applications. 2008 ed. Springer; Cham, Switzerland: New York, NY, USA: 2008.
- Solomonoff R.J. A formal theory of inductive inference, part 1 and part 2. Inform. Contr. 1964;7:224–254. doi: 10.1016/S0019-9958(64)90131-7. - DOI
- Turing A.M. On computable numbers, with an application to the Entscheidungsproblem. Proc. Lond. Math. Soc. 1937;42:230–265. doi: 10.1112/plms/s2-42.1.230. - DOI
- Zvonkin A.K., Levin L.A. The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russ. Math. Surv. 1970;25:83–124. doi: 10.1070/RM1970v025n06ABEH001269. - DOI
Publication types
LinkOut - more resources
Full Text Sources