Algorithmic Complexity and Randomness: Recent Developments

DOI10.1137/1137017MaRDI QIDQ4007616zbMATH OpenOpenAlexFDO

Authors

Publication date 27 September 1992

Published in Theory of Probability & Its Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1137017

zbMATH Keywords

algorithmic definition of randomnesscomplexityentropygeneration of random numbers

Mathematics Subject Classification ID

Foundations of probability theory (60A99)

Recommendations

• Algorithmic Randomness
• Computability, algorithmic randomness and complexity
• Randomness, computation and mathematics
• Kolmogorov complexity in perspective. I: Information theory and randomness
• scientific article; zbMATH DE number 53549

Cited in

(8)

• Large data series: modeling the usual to identify the unusual.
• Around Kolmogorov complexity: basic notions and results
• scientific article; zbMATH DE number 5657607 (Why is no real title available?)
• scientific article; zbMATH DE number 4020074 (Why is no real title available?)
• Algorithmic Randomness
• Mathematical Foundations of Computer Science 2004
• Every 2-random real is Kolmogorov random
• There is no SW-complete c.e. real

This page was built for publication: Algorithmic Complexity and Randomness: Recent Developments

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