On-Line Probability, Complexity and Randomness

DOI10.1007/978-3-540-87987-9_15MaRDI QIDQ3529916zbMATH OpenOpenAlexWikidataFDO

Authors Alexey Chernov, A. Shen, Nikolai K. Vereshchagin, Vladimir Vovk

Publication date 14 October 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-87987-9_15

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• scientific article; zbMATH DE number 4113619
• Random numbers as probabilities of machine behavior
• Chaitin complexity, Shannon information content of a single event, and infinite random sequences. II
• Probabilistic Algorithmic Randomness
• Chaitin complexity, Shannon information content of a single event and infinite random sequences. I

Cited in

(12)

• Conditional probabilities and van Lambalgen's theorem revisited
• Guessing fractions of online sequences
• Why computational complexity requires stricter martingales
• Algorithmic tests and randomness with respect to a class of measures
• Randomized Online Algorithms with High Probability Guarantees
• Sub-computable bounded pseudorandomness
• Prequential Randomness
• scientific article; zbMATH DE number 2086651 (Why is no real title available?)
• Imprecision in martingale- and test-theoretic prequential randomness
• Space-bounded online Kolmogorov complexity is additive
• Algorithmic randomness and splitting of supermartingales
• Prequential randomness and probability

This page was built for publication: On-Line Probability, Complexity and Randomness

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3529916)