Topological arguments for Kolmogorov complexity
Discrete Mathematics
2015-01-27 v3 Computational Complexity
Information Theory
math.IT
Abstract
We present several application of simple topological arguments in problems of Kolmogorov complexity. Basically we use the standard fact from topology that the disk is simply connected. It proves to be enough to construct strings with some nontrivial algorithmic properties.
Keywords
Cite
@article{arxiv.1206.4927,
title = {Topological arguments for Kolmogorov complexity},
author = {Alexander Shen and Andrei Romashchenko},
journal= {arXiv preprint arXiv:1206.4927},
year = {2015}
}
Comments
Extended version