Kolmogorov Complexity and Information Content
Information Theory
2017-10-19 v1 Computational Complexity
math.IT
Abstract
In this paper, we revisit a central concept in Kolmogorov complexity in which one would equate program-size complexity with information content. Despite the fact that Kolmogorov complexity has been widely accepted as an objective measure of the information content of a string, it has been the subject of many criticisms including the fundamental one directed by logicians and philosophers towards the statistical and semantical theories of information, which is about confusing an object and its name. In this paper, we clarify a number of subtle issues that are at the center of this debate.
Cite
@article{arxiv.1710.06846,
title = {Kolmogorov Complexity and Information Content},
author = {Fouad B. Chedid},
journal= {arXiv preprint arXiv:1710.06846},
year = {2017}
}
Comments
12 pages