Conditional measure and the violation of van Lambalgen's theorem for Martin-Löf randomness

DOI10.1007/s00224-016-9675-3zbMath1420.03098OpenAlexW2342363146MaRDI QIDQ519903

Bruno Bauwens

Publication date: 31 March 2017

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-016-9675-3

zbMATH Keywords

Martin-Löf randomnessconditional measurevan Lambalgen's theorem

Mathematics Subject Classification ID

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

Related Items (3)

Bayesian definition of random sequences with respect to conditional probabilities ⋮ Conditional probabilities and van Lambalgen's theorem revisited ⋮ Computable Measure Theory and Algorithmic Randomness

Cites Work

• When does randomness come from randomness?
• Algorithmic randomness and monotone complexity on product space
• On a definition of random sequences with respect to conditional probability
• Strong reductions in effective randomness
• The probability distribution as a computational resource for randomness testing
• A Theory of Program Size Formally Identical to Information Theory
• The axiomatization of randomness

This page was built for publication: Conditional measure and the violation of van Lambalgen's theorem for Martin-Löf randomness