scientific article; zbMATH DE number 1548484

MaRDI QIDQ4522700zbMATH OpenFDO

Authors Gregory J. Chaitin

Publication date 3 January 2001

zbMATH Keywords

algorithmic information theory

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Kolmogorov Complexity and Algorithmic Randomness
• scientific article; zbMATH DE number 736618
• scientific article; zbMATH DE number 44959
• Algorithmic randomness and complexity.
• scientific article; zbMATH DE number 1911266

Cited in

(11)

• Unpredictability and computational irreducibility
• Process physics: Inertia, gravity and the quantum
• On explicating the concept `the power of an arithmetical theory'
• Kurt Gödel's Anticipation of the Turing Machine: A Vitalistic Approach
• A frequentist interpretation of probability for model-based inductive inference
• Randomness relative to Cantor expansions
• Computing a Glimpse of Randomness
• A topological characterization of random sequences
• Exploring the randomness of mentally generated head–tail sequences
• Differences of halting probabilities
• Computational universes

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 Q4522700)