Topological arguments for Kolmogorov complexity
Alexander Shen, Andrei Romashchenko
Electronic Proceedings in Theoretical Computer Science · 2012
doi:10.4204/eptcs.90.10 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
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.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.