Why Kolmogorov complexity?

DOI10.1007/978-94-010-0920-1_5MaRDI QIDQ2797264zbMATH OpenOpenAlexFDO

Authors V. A. Uspenskiĭ

Publication date 5 April 2016

Published in Complex Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-94-010-0920-1_5

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Information theory (general) (94A15)

Recommendations

• scientific article; zbMATH DE number 107774
• scientific article; zbMATH DE number 5294121
• Kolmogorov complexity in perspective. I: Information theory and randomness
• Chaitin complexity, Shannon information content of a single event and infinite random sequences. I
• Around Kolmogorov complexity: basic notions and results

Cited in

(9)

• Chaitin complexity, Shannon information content of a single event and infinite random sequences. I
• The Kolmogorov complexity of infinite words
• Occam bound on lowest complexity of elements
• Algorithmic Information Theory and Foundations of Probability
• Combinatorial foundations of information theory and the calculus of probabilities
• scientific article; zbMATH DE number 3557669 (Why is no real title available?)
• scientific article; zbMATH DE number 1107583 (Why is no real title available?)
• Kolmogorov complexity of categories
• Discussion on Kolmogorov Complexity and Statistical Analysis

This page was built for publication: Why Kolmogorov complexity?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2797264)