Kolmogorov complexity in perspective
Logic
2008-01-03 v1 Computational Complexity
Information Theory
math.IT
Abstract
We 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.
Cite
@article{arxiv.0801.0354,
title = {Kolmogorov complexity in perspective},
author = {Marie Ferbus-Zanda and Serge Grigorieff},
journal= {arXiv preprint arXiv:0801.0354},
year = {2008}
}
Comments
37 pages