Abstract
The notion of Kolmogorov complexity (=the minimal length of a program that generates some object) is often useful as a kind of language that allows us to reformulate some notions and therefore provide new intuition. In this survey we provide (with minimal comments) many different examples where notions and statements that involve Kolmogorov complexity are compared with their counterparts not involving complexity. © 2011 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Shen, A. (2011). Kolmogorov complexity as a language. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6651 LNCS, pp. 105–119). https://doi.org/10.1007/978-3-642-20712-9_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
