Computable randomness is about more than probabilities
From MaRDI portal
Publication:6339836
DOI10.1007/978-3-030-58449-8_12zbMath1517.68149arXiv2005.00471MaRDI QIDQ6339836
Floris Persiau, Gert De Cooman, Jasper De Bock
Publication date: 1 May 2020
Generalizations of martingales (60G48) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Foundations of probability theory (60A99)
Related Items (2)
Randomness is inherently imprecise ⋮ On the (dis)similarities between stationary imprecise and non-stationary precise uncertainty models in algorithmic randomness
This page was built for publication: Computable randomness is about more than probabilities
