Kolmogorov Complexity in perspective. Part I: Information Theory and Randomnes
Logic in Computer Science
2010-10-20 v1 Computational Complexity
Information Theory
math.IT
Abstract
We survey diverse approaches to the notion of information: from Shannon entropy to Kolmogorov complexity. Two of the main applications of Kolmogorov complexity are presented: randomness and classification. The survey is divided in two parts in the same volume. Part I is dedicated to information theory and the mathematical formalization of randomness based on Kolmogorov complexity. This last application goes back to the 60's and 70's with the work of Martin-L\"of, Schnorr, Chaitin, Levin, and has gained new impetus in the last years.
Keywords
Cite
@article{arxiv.1010.3201,
title = {Kolmogorov Complexity in perspective. Part I: Information Theory and Randomnes},
author = {Marie Ferbus-Zanda and Serge Grigorieff},
journal= {arXiv preprint arXiv:1010.3201},
year = {2010}
}
Comments
40 pages