Topological arguments for Kolmogorov complexity

Topological arguments for Kolmogorov complexity

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.

Bibliographic Details
Main Authors: Alexander Shen, Andrei Romashchenko
Format: Article
Language:English
Published: Open Publishing Association 2012-08-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/1206.4927v2
id doaj-cf5819c84e654b95b3117da2277af04e
record_format Article
spelling doaj-cf5819c84e654b95b3117da2277af04e2020-11-24T22:30:27ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802012-08-0190Proc. AUTOMATA&JAC 201212713210.4204/EPTCS.90.10Topological arguments for Kolmogorov complexityAlexander ShenAndrei RomashchenkoWe 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.http://arxiv.org/pdf/1206.4927v2
collection DOAJ
language English
format Article
sources DOAJ
author Alexander Shen
Andrei Romashchenko
spellingShingle Alexander Shen
Andrei Romashchenko
Topological arguments for Kolmogorov complexity
Electronic Proceedings in Theoretical Computer Science
author_facet Alexander Shen
Andrei Romashchenko
author_sort Alexander Shen
title Topological arguments for Kolmogorov complexity
title_short Topological arguments for Kolmogorov complexity
title_full Topological arguments for Kolmogorov complexity
title_fullStr Topological arguments for Kolmogorov complexity
title_full_unstemmed Topological arguments for Kolmogorov complexity
title_sort topological arguments for kolmogorov complexity
publisher Open Publishing Association
series Electronic Proceedings in Theoretical Computer Science
issn 2075-2180
publishDate 2012-08-01
description 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.
url http://arxiv.org/pdf/1206.4927v2
work_keys_str_mv AT alexandershen topologicalargumentsforkolmogorovcomplexity
AT andreiromashchenko topologicalargumentsforkolmogorovcomplexity
_version_ 1725740992552763392

Similar Items