Comparing notions of randomness

DOI10.1016/j.tcs.2009.09.036zbMath1184.68274OpenAlexW1972906861MaRDI QIDQ844892

Bart Kastermans, Steffen Lempp

Publication date: 5 February 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.09.036

zbMATH Keywords

Martin-Löf randomnesseffective randomnessKolmogorov-Loveland randomness

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (4)

Probabilistic Algorithmic Randomness ⋮ Some Questions in Computable Mathematics ⋮ Strong reductions in effective randomness ⋮ Computable randomness and betting for computable probability spaces

Cites Work

• Unnamed Item
• Unnamed Item
• A separation of two randomness concepts
• Mathematical metaphysics of randomness
• Process complexity and effective random tests
• Kolmogorov-Loveland randomness and stochasticity
• Algorithmic Randomness and Complexity
• Randomness and Computability: Open Questions
• A Generalization of Resource-Bounded Measure, with Application to the BPP vs. EXP Problem
• A unified approach to the definition of random sequences

This page was built for publication: Comparing notions of randomness