Busy Beavers and Kolmogorov Complexity

DOI10.1007/978-3-319-40189-8_20zbMath1477.03165arXiv1703.05170OpenAlexW2506563702MaRDI QIDQ3188257

Mikhail Andreev

Publication date: 17 August 2016

Published in: Pursuit of the Universal (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)

Cites Work

• On the relation between descriptional complexity and algorithmic probability
• Around Kolmogorov Complexity: Basic Notions and Results
• Random Semicomputable Reals Revisited
• Kolmogorov Complexity and Algorithmic Randomness
• An introduction to Kolmogorov complexity and its applications

This page was built for publication: Busy Beavers and Kolmogorov Complexity