Constructive Equivalence Relations on Computable Probability Measures

DOI10.1007/11753728_12MaRDI QIDQ3434685zbMATH OpenOpenAlexFDO

Authors Laurent Bienvenu

Publication date 2 May 2007

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11753728_12

Mathematics Subject Classification ID

Algorithmic randomness and dimension (03D32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Constructive equivalence relations on computable probability measures
• Computable randomness and betting for computable probability spaces
• Effective randomness for computable probability measures
• Measures and their random reals
• Computability of probability measures and Martin-Löf randomness over metric spaces

Cited in

(8)

• Constructive equivalence relations on computable probability measures
• On relative and probabilistic finite counterability
• Equivalence relations among dominance concepts on probability intervals and general credal sets
• scientific article; zbMATH DE number 5309069 (Why is no real title available?)
• Computable measures coprojection consistent with ordering relation is not necessarily computable
• Notions of Probabilistic Computability on Represented Spaces
• Effective randomness for computable probability measures
• A Complete Axiomatisation for Probabilistic Trace Equivalence

This page was built for publication: Constructive Equivalence Relations on Computable Probability Measures

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