Constructive Equivalence Relations on Computable Probability Measures

A central object of study in the field of algorithmic randomness are notions of randomness for sequences, i.e., infinite sequences of zeros and ones. These notions are usually defined with respect to the uniform measure on the set of all sequences, but extend canonically to other computable probability measures. This way each notion of randomness induces an equivalence relation on the computable probability measures where two measures are equivalent if they have the same set of random sequences. In what follows, we study the equivalence relations induced by Martin-L

• Type: Conference
• Year: 2006
• Where: CSR
• Authors: Laurent Bienvenu
• Keywords: Computable Probability Measures, CSR 2006, Equivalence Relations, Randomness, Theoretical Computer Science