Conditional probabilities and van Lambalgen's theorem revisited
From MaRDI portal
Publication:1694006
DOI10.1007/s00224-017-9789-2zbMath1420.03099arXiv1607.04240OpenAlexW2500046133WikidataQ57349361 ScholiaQ57349361MaRDI QIDQ1694006
Alexander Shen, Bruno Bauwens, Hayato Takahashi
Publication date: 1 February 2018
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.04240
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)
Related Items
Schnorr randomness for noncomputable measures, Bayesian definition of random sequences with respect to conditional probabilities, Finite-state independence
Cites Work
- Unnamed Item
- Conditional measure and the violation of van Lambalgen's theorem for Martin-Löf randomness
- Algorithmic randomness and monotone complexity on product space
- On a definition of random sequences with respect to conditional probability
- Algorithmic tests and randomness with respect to a class of measures
- The probability distribution as a computational resource for randomness testing
- Kolmogorov Complexity and Algorithmic Randomness
- The axiomatization of randomness