On-Line Probability, Complexity and Randomness

DOI10.1007/978-3-540-87987-9_15zbMath1156.68406OpenAlexW1639327804WikidataQ57349727 ScholiaQ57349727MaRDI QIDQ3529916

Alexei Chernov, Alexander Shen, Vladimir Vovk, Nikolai K. Vereshchagin

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)

Related Items (5)

Sub-computable Bounded Pseudorandomness ⋮ Prequential Randomness ⋮ Prequential randomness and probability ⋮ Algorithmic tests and randomness with respect to a class of measures ⋮ Algorithmic randomness and splitting of supermartingales

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