Axiomatizing Kolmogorov complexity

DOI10.1007/s00224-012-9395-2zbMath1283.68178OpenAlexW1987317029MaRDI QIDQ1946501

Antoine Taveneaux

Publication date: 15 April 2013

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

Full work available at URL: https://doi.org/10.1007/s00224-012-9395-2

zbMATH Keywords

Kolmogorov complexityslow growing functions

Mathematics Subject Classification ID

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

Cites Work

• Algorithmic Randomness and Complexity
• On the Length of Programs for Computing Finite Binary Sequences
• Unnamed Item

This page was built for publication: Axiomatizing Kolmogorov complexity