A computable version of the random signs problem and Kolmogorov complexity

DOI10.1016/j.spl.2003.12.002zbMath1130.68065OpenAlexW2089518673MaRDI QIDQ2568322

Jack Jie Dai

Publication date: 10 October 2005

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.spl.2003.12.002

Mathematics Subject Classification ID

Combinatorial probability (60C05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (3)

Constraints placed on random sequences by their compressibility ⋮ Algorithmically random series and Brownian motion ⋮ Unnamed Item

Cites Work

• The Borel-Cantelli lemmas, probability laws and Kolmogorov complexity
• A Theory of Program Size Formally Identical to Information Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A computable version of the random signs problem and Kolmogorov complexity