Computability, algorithmic randomness and complexity

MaRDI QIDQ3224093zbMATH OpenFDO

Authors Rodney G. Downey

Publication date 29 March 2012

Full work available at URL http://ebooks.worldscinet.com/ISBN/9789814327756/9789814327756_0018.html

zbMATH Keywords

algorithmic randomnesscomputabilityKolmogorov complexity

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Analysis of algorithms and problem complexity (68Q25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Studying randomness through computation
• Algorithmic Randomness
• Randomness and Computability: Open Questions
• Randomness, computation and mathematics
• Algorithmic randomness and complexity.

Cited in

(17)

• On randomness, determinism and computability
• Preface: Taming randomness and complexity -- essays in honour of Professor Péter Gács
• scientific article; zbMATH DE number 1688364 (Why is no real title available?)
• Randomness, computation and mathematics
• Sub-computable Boundedness Randomness
• An introduction to (algorithmic) randomness
• Studying randomness through computation
• Randomness and Computability: Open Questions
• Calibrating Randomness
• Randomness – A Computational Complexity Perspective
• Computability and randomness
• Algorithmic Complexity and Randomness: Recent Developments
• scientific article; zbMATH DE number 1531917 (Why is no real title available?)
• Computable Measure Theory and Algorithmic Randomness
• Structure and Randomness in Computability and Set Theory
• scientific article; zbMATH DE number 5057386 (Why is no real title available?)
• \(\Pi_1^0\) classes, Peano arithmetic, randomness, and computable domination

This page was built for publication: Computability, algorithmic randomness and complexity

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