scientific article; zbMATH DE number 53549

MaRDI QIDQ4003741zbMATH OpenFDO

Authors A. N. Kolmogorov

Publication date 23 January 1993

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to history and biography (01-01) Collected or selected works; reprintings or translations of classics (01A75) Logic in computer science (03B70) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• scientific article; zbMATH DE number 2027966
• scientific article; zbMATH DE number 1864855
• Algorithmic information theory. Understanding computability and complexity
• Algorithmic information theory and computational complexity
• Information complexity and applications.
• Algorithmic Information Theory
• Algorithmic information theory
• scientific article; zbMATH DE number 5081004
• scientific article; zbMATH DE number 4039250

Cited in

(19)

• Algorithmic approach to dynamic information theory
• Preface: Taming randomness and complexity -- essays in honour of Professor Péter Gács
• scientific article; zbMATH DE number 4019037 (Why is no real title available?)
• scientific article; zbMATH DE number 428352 (Why is no real title available?)
• scientific article; zbMATH DE number 5081004 (Why is no real title available?)
• Combinatorial foundations of information theory and the calculus of probabilities
• scientific article; zbMATH DE number 4020074 (Why is no real title available?)
• Algorithmic Information Theory
• scientific article; zbMATH DE number 4096754 (Why is no real title available?)
• Algorithmic Complexity and Randomness: Recent Developments
• scientific article; zbMATH DE number 3557669 (Why is no real title available?)
• scientific article; zbMATH DE number 1216200 (Why is no real title available?)
• scientific article; zbMATH DE number 2066908 (Why is no real title available?)
• A Synthesis of Pseudo-Boolean Empirical Models by Precedential Information
• Elements of underdetermined information theory
• Kolmogorov complexity in perspective. I: Information theory and randomness
• An introduction to Kolmogorov complexity and its applications
• Some theorems on the algorithmic approach to probability theory and information theory (1971 dissertation directed by A. N. Kolmogorov)
• A measure of underdefined information

This page was built for publication:

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