On the (dis)similarities between stationary imprecise and non-stationary precise uncertainty models in algorithmic randomness

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

zbMATH Keywords

non-stationarityimprecise probabilitiesalgorithmic randomnesscomputability theorysupermartingalesprobability intervals

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Cites Work

• scientific article; zbMATH DE number 5595162 (Why is no real title available?)
• scientific article; zbMATH DE number 5606368 (Why is no real title available?)
• scientific article; zbMATH DE number 3489016 (Why is no real title available?)
• scientific article; zbMATH DE number 3532844 (Why is no real title available?)
• scientific article; zbMATH DE number 1531917 (Why is no real title available?)
• scientific article; zbMATH DE number 3026521 (Why is no real title available?)
• 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)

• The twelfth international symposium on imprecise probabilities: theories and applications (ISIPTA-21)
• Imprecision in martingale- and test-theoretic prequential randomness
• On the (dis)similarities between stationary imprecise and non-stationary precise uncertainty models in algorithmic randomness

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)