Towards an Axiomatic System for Kolmogorov Complexity

DOI10.1007/978-3-642-21875-0_30zbMath1345.68184arXiv1102.0686OpenAlexW2962692142MaRDI QIDQ3091466

Antoine Taveneaux

Publication date: 9 September 2011

Published in: Models of Computation in Context (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Cites Work

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

This page was built for publication: Towards an Axiomatic System for Kolmogorov Complexity