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

• Algorithmic randomness and complexity.
• Title not available (Why is that?)
• Introduction to imprecise probabilities
• The definition of random sequences
• Algorithmic tests and randomness with respect to a class of measures
• Title not available (Why is that?)
• Title not available (Why is that?)
• Kolmogorov Complexity and Algorithmic Randomness
• 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
• 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
• Title not available (Why is that?)
• Computability in analysis and physics
• Prequential randomness and probability
• Title not available (Why is that?)
• Game-theoretic foundations for probability and finance
• Title not available (Why is that?)
• Game-theoretic upper expectations for discrete-time finite-state uncertain processes
• A particular upper expectation as global belief model for discrete-time finite-state uncertain processes
• Randomness is inherently imprecise
• Computable randomness is about more than probabilities
• The smallest probability interval a sequence is random for: a study for six types of randomness
• How much randomness is needed for statistics?

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)