A brief introduction to Kolmogorov complexity and its applications

MaRDI QIDQ4035322zbMATH OpenFDO

Authors Paul M. B. Vitányi, Ming Li

Publication date 18 May 1993

zbMATH Keywords

descriptive complexityKolmogorov-Chaitin randomnessminimum description length principleprogram size complexitystochastic complexity

Mathematics Subject Classification ID

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

Recommendations

• An introduction to Kolmogorov complexity and its applications
• An introduction to Kolmogorov complexity and its applications
• An introduction to Kolmogorov complexity and its applications
• An introduction to Kolmogorov complexity and its applications. 2nd ed
• Kolmogorov Complexity: Sources, Theory and Applications
• Around Kolmogorov complexity: basic notions and results
• scientific article; zbMATH DE number 4086981
• scientific article; zbMATH DE number 7701424
• Approximating Kolmogorov complexity
• Kolmogorov complexity and computational complexity

Cited in

(10)

• A strange application of Kolmogorov complexity
• Around Kolmogorov complexity: basic notions and results
• scientific article; zbMATH DE number 4019037 (Why is no real title available?)
• scientific article; zbMATH DE number 4086981 (Why is no real title available?)
• Kolmogorov Complexity: Sources, Theory and Applications
• Kolmogorov complexity and chaotic phenomena
• On the Kolmogorov-Chaitin Complexity for short sequences
• An introduction to Kolmogorov complexity and its applications
• The communication complexity of enumeration, elimination, and selection
• The application of the construction of Kolmogorov complexity and of a theorem by Maslov to semiotic systems

This page was built for publication: A brief introduction to Kolmogorov complexity and its applications

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