Kolmogorov complexity in perspective

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 published in a same volume. Part II is dedicated to the relation between logic and information system, within the scope of Kolmogorov algorithmic information theory. We present a recent application of Kolmogorov complexity: classification using compression, an idea with provocative implementation by authors such as Bennett, Vit

• Type: Journal
• Year: 2008
• Where: CORR
• Authors: Marie Ferbus-Zanda, Serge Grigorieff
• Keywords: CORR 2008, Education, Information System, Kolmogorov Algorithmic Information, Kolmogorov Complexity