Probabilistic Algorithmic Randomness

DOI10.2178/jsl.7802130zbMath1305.03037OpenAlexW2021928889MaRDI QIDQ5300079

Mia Minnes, Samuel R. Buss

Publication date: 24 June 2013

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.jsl/1368627066

zbMATH Keywords

Martin-Löf randomnessalgorithmic randomnesscomputable randomness(partially) computable martingalespartial computable randomness

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)

Related Items

How to gamble against all odds

Cites Work

• Unnamed Item
• Comparing notions of randomness
• Mathematical metaphysics of randomness
• Why computational complexity requires stricter martingales
• Some results on effective randomness
• Algorithmic Randomness and Complexity
• Computational Complexity
• A unified approach to the definition of random sequences
• The definition of random sequences
• An introduction to Kolmogorov complexity and its applications
• Computational Complexity

This page was built for publication: Probabilistic Algorithmic Randomness