Kolmogorov complexity as a language
Information Theory
2011-03-01 v1 math.IT
Logic
Abstract
The notion of Kolmogorov complexity (=the minimal length of a program that generates some object) is often useful as a kind of language that allows us to reformulate some notions and therefore provide new intuition. In this survey we provide (with minimal comments) many different examples where notions and statements that involve Kolmogorov complexity are compared with their counterparts not involving complexity.
Cite
@article{arxiv.1102.5418,
title = {Kolmogorov complexity as a language},
author = {Alexander Shen},
journal= {arXiv preprint arXiv:1102.5418},
year = {2011}
}
Comments
Invited talk prepared for CSR 2011