Complexity and randomness

zbMATH Open1121.68058MaRDI QIDQ3418262FDOQ3418262

Sebastiaan A. Terwijn

Publication date: 2 February 2007

Recommendations

• Around Kolmogorov complexity: basic notions and results
• Algorithmic randomness and complexity.
• Algorithmic randomness and measures of complexity
• The Kolmogorov complexity of random reals
• Kolmogorov Complexity and Algorithmic Randomness

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Other Turing degree structures (03D28) Complexity of computation (including implicit computational complexity) (03D15) Applications of computability and recursion theory (03D80) Other connections with logic and set theory (28E15)

Cited In (10)

• The Medvedev lattice of computably closed sets
• Title not available (Why is that?)
• Complexity of generation
• Randomness – A Computational Complexity Perspective
• Title not available (Why is that?)
• On partial randomness
• Title not available (Why is that?)
• Fractal dimension versus process complexity
• Exact constructive and computable dimensions
• Strong jump-traceability. II: \(K\)-triviality

This page was built for publication: Complexity and randomness

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