Non-Algorithmic Theory of Randomness

DOI10.1007/978-3-030-48006-6_21OpenAlexW3030399316MaRDI QIDQ5049058

Vladimir Vovk

Publication date: 9 November 2022

Published in: Fields of Logic and Computation III (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.00585

zbMATH Keywords

exchangeabilityalgorithmic randomnessstatistical hypothesis testingP-valuebetting scoreE-valuestatistical randomness

Mathematics Subject Classification ID

Logic in computer science (03B70) Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extremal families and systems of sufficient statistics
• Learning about the parameter of the Bernoulli model
• Theory of statistics
• Kolmogorov's contributions to the foundations of probability
• Uniform test of algorithmic randomness over a general space
• On the concept of the Bernoulli property
• Combinatorial foundations of information theory and the calculus of probabilities
• Kolmogorov Complexity and Algorithmic Randomness
• Algorithmic Complexity and Stochastic Properties of Finite Binary Sequences
• Game‐Theoretic Foundations for Probability and Finance
• Logical basis for information theory and probability theory
• The definition of random sequences
• ValidP-Values Behave Exactly as They Should: Some Misleading Criticisms ofP-Values and Their Resolution WithS-Values
• Algorithmic Learning Theory
• An introduction to Kolmogorov complexity and its applications

This page was built for publication: Non-Algorithmic Theory of Randomness