Constructive equivalence relations on computable probability measures

DOI10.1016/J.APAL.2009.01.002zbMath1201.03028OpenAlexW2013551323MaRDI QIDQ1032627

Laurent Bienvenu, Wolfgang Merkle

Publication date: 26 October 2009

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2009.01.002

zbMATH Keywords

Kolmogorov complexityprobability measurescomputable analysisalgorithmic randomness

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32) Hierarchies of computability and definability (03D55)

Related Items (5)

LUZIN’S (N) AND RANDOMNESS REFLECTION ⋮ Algorithmic identification of probabilities is hard ⋮ Strong reductions in effective randomness ⋮ How powerful are integer-valued martingales? ⋮ Computable randomness and betting for computable probability spaces

Cites Work

• Mathematical metaphysics of randomness
• Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
• Kolmogorov-Loveland randomness and stochasticity
• On equivalence of infinite product measures
• The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences
• Schnorr randomness
• A unified approach to the definition of random sequences
• The definition of random sequences
• Randomness, relativization and Turing degrees
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Constructive equivalence relations on computable probability measures