Effective randomness for computable probability measures

DOI10.1016/J.ENTCS.2006.08.010MaRDI QIDQ4921439zbMATH OpenOpenAlexFDO

Authors Laurent Bienvenu, Wolfgang Merkle

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

zbMATH Keywords

computable probability measurescomputable randomnessconsistency of probability measuresequivalence of probability measuresMartin-Löf randomnessSchnorr randomnessweak randomness

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Computation over the reals, computable analysis (03D78) Probabilistic measure theory (60A10) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Constructive equivalence relations on computable probability measures
• Randomness on computable probability spaces -- a dynamical point of view
• Constructive Equivalence Relations on Computable Probability Measures
• Some results on effective randomness
• Automata, Languages and Programming

Cites work

• A unified approach to the definition of random sequences
• Algorithmic randomness and complexity.
• Constructive Equivalence Relations on Computable Probability Measures
• scientific article; zbMATH DE number 969633 (Why is no real title available?)
• Mathematical metaphysics of randomness
• Randomness, relativization and Turing degrees
• The definition of random sequences
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)

Cited in

(15)

• An approach of randomness of a sample based on its weak ergodic limit
• Partially effective randomization in simulations between ARBITRARY and COMMON PRAMs
• Statistical properties of dynamical systems -- Simulation and abstract computation
• Algorithmically Random Functions and Effective Capacities
• Effective bi-immunity and randomness
• A relation between correctness and randomness in the computation of probabilistic algorithms
• Constructive Equivalence Relations on Computable Probability Measures
• RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY
• Effective Brenier Theorem
• Computable Measure Theory and Algorithmic Randomness
• Randomness on computable probability spaces -- a dynamical point of view
• Randomness on computable probability spaces -- a dynamical point of view
• Automata, Languages and Programming
• Algorithmic randomness and monotone complexity on product space
• Computability in infinite Galois theory and algorithmically random algebraic fields

This page was built for publication: Effective randomness for computable probability measures

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