文章基本信息

标题：Topological arguments for Kolmogorov complexity
本地全文：下载
作者：Alexander Shen ; Andrei Romashchenko
期刊名称：Electronic Proceedings in Theoretical Computer Science
电子版ISSN：2075-2180
出版年度：2012
卷号：90
页码：127-132
DOI：10.4204/EPTCS.90.10
出版社：Open Publishing Association
摘要：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.