Topological arguments for Kolmogorov complexity

DOI10.1007/S00224-015-9606-8zbMath1331.68119DBLPjournals/mst/RomashchenkoS15arXiv1206.4927OpenAlexW2001034866WikidataQ57349422 ScholiaQ57349422MaRDI QIDQ2354581

Alexander Shen, Andrei Romashchenko

Publication date: 20 July 2015

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1206.4927

zbMATH Keywords

Kolmogorov complexitytopologyexistence proofs

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (2)

Relating and contrasting plain and prefix Kolmogorov complexity ⋮ Topological arguments for Kolmogorov complexity

Cites Work

• Unnamed Item
• Short lists with short programs in short time
• Topological arguments for Kolmogorov complexity
• Game Arguments in Computability Theory and Algorithmic Information Theory
• An introduction to Kolmogorov complexity and its applications
• Conditional complexity and codes
• Information distance and conditional complexities

This page was built for publication: Topological arguments for Kolmogorov complexity