Probabilistic Algorithmic Randomness
From MaRDI portal
Publication:5300079
DOI10.2178/jsl.7802130zbMath1305.03037MaRDI QIDQ5300079
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
Martin-Löf randomness; algorithmic randomness; computable randomness; (partially) computable martingales; partial computable randomness
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
03D32: Algorithmic randomness and dimension
Related Items
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