On the (dis)similarities between stationary imprecise and non-stationary precise uncertainty models in algorithmic randomness
From MaRDI portal
Publication:2105577
DOI10.1016/j.ijar.2022.10.002OpenAlexW4302363047MaRDI QIDQ2105577
Jasper De Bock, Floris Persiau, Gert De Cooman
Publication date: 8 December 2022
Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.09499
supermartingalescomputability theoryprobability intervalsimprecise probabilitiesnon-stationarityalgorithmic randomness
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The challenge of chance. A multidisciplinary approach from science and the humanities
- Imprecise stochastic processes in discrete time: global models, imprecise Markov chains, and ergodic theorems
- Prequential randomness and probability
- Game-theoretic upper expectations for discrete-time finite-state uncertain processes
- Randomness is inherently imprecise
- The smallest probability interval a sequence is random for: a study for six types of randomness
- A particular upper expectation as global belief model for discrete-time finite-state uncertain processes
- How much randomness is needed for statistics?
- Algorithmic tests and randomness with respect to a class of measures
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
- The probability distribution as a computational resource for randomness testing
- Algorithmic Randomness and Complexity
- Kolmogorov Complexity and Algorithmic Randomness
- Game‐Theoretic Foundations for Probability and Finance
- Computability in Analysis and Physics
- Introduction to Imprecise Probabilities
- The definition of random sequences
- Computable randomness is about more than probabilities
