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 QIDQ2105577FDOQ2105577
Authors: Floris Persiau, Jasper De Bock, 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
non-stationarityimprecise probabilitiesalgorithmic randomnesscomputability theorysupermartingalesprobability intervals
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A particular upper expectation as global belief model for discrete-time finite-state uncertain processes
- Algorithmic randomness and complexity.
- Algorithmic tests and randomness with respect to a class of measures
- Computability in analysis and physics
- Computable randomness is about more than probabilities
- Game-theoretic foundations for probability and finance
- Game-theoretic upper expectations for discrete-time finite-state uncertain processes
- Imprecise stochastic processes in discrete time: global models, imprecise Markov chains, and ergodic theorems
- Introduction to imprecise probabilities
- Kolmogorov Complexity and Algorithmic Randomness
- Prequential randomness and probability
- Randomness is inherently imprecise
- The challenge of chance. A multidisciplinary approach from science and the humanities
- The definition of random sequences
- The probability distribution as a computational resource for randomness testing
- The smallest probability interval a sequence is random for: a study for six types of randomness
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
Cited In (3)
This page was built for publication: On the (dis)similarities between stationary imprecise and non-stationary precise uncertainty models in algorithmic randomness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2105577)