Algorithmic randomness and monotone complexity on product space

DOI10.1016/j.ic.2010.10.003zbMath1215.68115arXiv0910.5076OpenAlexW2111718176MaRDI QIDQ627131

Hayato Takahashi

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

zbMATH Keywords

algorithmic randomnessLambalgen's theoremmonotone complexity

Mathematics Subject Classification ID

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

Related Items (6)

Schnorr randomness for noncomputable measures ⋮ Bayesian definition of random sequences with respect to conditional probabilities ⋮ Conditional probabilities and van Lambalgen's theorem revisited ⋮ Layerwise computability and image randomness ⋮ Conditional measure and the violation of van Lambalgen's theorem for Martin-Löf randomness ⋮ Computable Measure Theory and Algorithmic 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

This page was built for publication: Algorithmic randomness and monotone complexity on product space