Conditional measure and the violation of van Lambalgen's theorem for Martin-Löf randomness
From MaRDI portal
Publication:519903
DOI10.1007/S00224-016-9675-3zbMATH Open1420.03098OpenAlexW2342363146MaRDI QIDQ519903FDOQ519903
Authors: B. 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
Recommendations
Algorithmic randomness and dimension (03D32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)
Cites Work
- A Theory of Program Size Formally Identical to Information Theory
- Strong reductions in effective randomness
- When does randomness come from randomness?
- The probability distribution as a computational resource for randomness testing
- On a definition of random sequences with respect to conditional probability
- The axiomatization of randomness
- Algorithmic randomness and monotone complexity on product space
Cited In (8)
- An extension of van Lambalgen's theorem to infinitely many relative 1-random reals
- Bayesian definition of random sequences with respect to conditional probabilities
- On a definition of random sequences with respect to conditional probability
- Computable Measure Theory and Algorithmic Randomness
- Conditional probabilities and van Lambalgen's theorem revisited
- A van Lambalgen theorem for Demuth randomness
- Uniform van Lambalgen's theorem fails for computable randomness
- Independence, relative randomness, and PA degrees
This page was built for publication: Conditional measure and the violation of van Lambalgen's theorem for Martin-Löf randomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q519903)
