Computable randomness is about more than probabilities

DOI10.1007/978-3-030-58449-8_12MaRDI QIDQ6339836zbMATH OpenFDO

Authors Floris Persiau, Jasper De Bock, Gert De Cooman

Publication date 1 May 2020

Full work available at URL https://doi.org/10.1007/978-3-030-58449-8_12

Mathematics Subject Classification ID

Foundations of probability theory (60A99) Generalizations of martingales (60G48) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Abstract: We introduce a notion of computable randomness for infinite sequences that generalises the classical version in two important ways. First, our definition of computable randomness is associated with imprecise probability models, in the sense that we consider lower expectations (or sets of probabilities) instead of classical 'precise' probabilities. Secondly, instead of binary sequences, we consider sequences whose elements take values in some finite sample space. Interestingly, we find that every sequence is computably random with respect to at least one lower expectation, and that lower expectations that are more informative have fewer computably random sequences. This leads to the intriguing question whether every sequence is computably random with respect to a unique most informative lower expectation. We study this question in some detail and provide a partial answer.

Recommendations

• Computable randomness and betting for computable probability spaces
• Uniform van Lambalgen's theorem fails for computable randomness
• Effective martingales with restricted wagers
• scientific article; zbMATH DE number 1531917

Cited in

(7)

• Randomness is inherently imprecise
• On the (dis)similarities between stationary imprecise and non-stationary precise uncertainty models in algorithmic randomness
• Computable randomness and betting for computable probability spaces
• scientific article; zbMATH DE number 6019540 (Why is no real title available?)
• A computational definition of financial randomness
• A comparative study of the smallest probability intervals for which a binary sequence is random
• Randomness and imprecision: from supermartingales to randomness tests

This page was built for publication: Computable randomness is about more than probabilities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6339836)