How much randomness is needed for statistics?

DOI10.1007/978-3-642-30870-3_40zbMath1351.68122arXiv1408.2862OpenAlexW2963127107MaRDI QIDQ2453071

Antoine Taveneaux, Neil Thapen, Bjørn Kjos-Hanssen

Publication date: 6 June 2014

Published in: Annals of Pure and Applied Logic, Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1408.2862

zbMATH Keywords

martingalesBernoulli measuresHippocratic randomness

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Algorithmic randomness and dimension (03D32)

Related Items (2)

How much randomness is needed for statistics? ⋮ On the (dis)similarities between stationary imprecise and non-stationary precise uncertainty models in algorithmic randomness

Cites Work

• Unnamed Item
• Constructive dimension and Turing degrees
• Kolmogorov-Loveland stochasticity and Kolmogorov complexity
• Mathematical metaphysics of randomness
• Resource bounded randomness and computational complexity
• How much randomness is needed for statistics?
• Algorithmic tests and randomness with respect to a class of measures
• Uniform test of algorithmic randomness over a general space
• Kolmogorov-Loveland randomness and stochasticity
• Randomness for non-computable measures
• The probability distribution as a computational resource for randomness testing
• Algorithmic Randomness and Complexity
• The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences

This page was built for publication: How much randomness is needed for statistics?