Algorithmic randomness and monotone complexity on product space
From MaRDI portal
Publication:627131
DOI10.1016/j.ic.2010.10.003zbMath1215.68115arXiv0910.5076MaRDI QIDQ627131
Publication date: 21 February 2011
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0910.5076
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
03D32: Algorithmic randomness and dimension
Related Items
Computable Measure Theory and Algorithmic Randomness, Conditional measure and the violation of van Lambalgen's theorem for Martin-Löf randomness, Schnorr randomness for noncomputable measures, Conditional probabilities and van Lambalgen's theorem revisited, Layerwise computability and image randomness
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a definition of random sequences with respect to conditional probability
- Mathematical metaphysics of randomness
- Ergodic theorems for individual random sequences
- Process complexity and effective random tests
- On equivalence of infinite product measures
- Can an individual sequence of zeros and ones be random?
- Redundancy of Universal Coding, Kolmogorov Complexity, and Hausdorff Dimension
- Randomness Criteria in Terms of $ {\alpha }$-Divergences
- Von Mises' definition of random sequences reconsidered
- Probability with Martingales
- The minimum description length principle in coding and modeling
- Relations between varieties of kolmogorov complexities
- Effective Randomness for Computable Probability Measures
- Algorithmic Learning Theory
- The definition of random sequences
