Effective Randomness for Computable Probability Measures
From MaRDI portal
Publication:4921439
DOI10.1016/j.entcs.2006.08.010zbMath1262.03064MaRDI QIDQ4921439
Wolfgang Merkle, Laurent Bienvenu
Publication date: 10 May 2013
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2006.08.010
equivalence of probability measures; Martin-Löf randomness; Schnorr randomness; computable randomness; weak randomness; computable probability measures; consistency of probability measures
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
60A10: Probabilistic measure theory
03D32: Algorithmic randomness and dimension
03D78: Computation over the reals, computable analysis
Related Items
Computable Measure Theory and Algorithmic Randomness, Algorithmic randomness and monotone complexity on product space, Statistical properties of dynamical systems -- Simulation and abstract computation
Cites Work
- Unnamed Item
- Mathematical metaphysics of randomness
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
- Algorithmic Randomness and Complexity
- Constructive Equivalence Relations on Computable Probability Measures
- A unified approach to the definition of random sequences
- The definition of random sequences
- Randomness, relativization and Turing degrees