Repository landing page
research
Kolmogorov complexity in perspective.
Abstract
37 pagesWe survey the diverse approaches to the notion of information content: from Shannon entropy to Kolmogorov complexity. The main applications of Kolmogorov complexity are presented namely, the mathematical notion of randomness (which goes back to the 60's with the work of Martin-Lof, Schnorr, Chaitin, Levin), and classification, which is a recent idea with provocative implementation by Vitanyi and Cilibrasi- info:eu-repo/semantics/preprint
- Preprints, Working Papers, ...
- Logic
- Computer Science
- Information Theory
- Kolmogorov Complexity
- Entropy
- Randomness
- Classification
- Compression
- [MATH.MATH-LO]Mathematics [math]/Logic [math.LO]
- [INFO.INFO-LO]Computer Science [cs]/Logic in Computer Science [cs.LO]
- [MATH.MATH-IT]Mathematics [math]/Information Theory [math.IT]
- [INFO.INFO-IT]Computer Science [cs]/Information Theory [cs.IT]
- [INFO.INFO-CC]Computer Science [cs]/Computational Complexity [cs.CC]
Similar works
This paper was published in Hal-Diderot.
Having an issue?
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.