The probability distribution as a computational resource for randomness testing

DOI10.4115/JLA.2010.2.10zbMath1286.68251arXiv1408.2850OpenAlexW2151044444MaRDI QIDQ3145956

Bjørn Kjos-Hanssen

Publication date: 17 December 2012

Published in: Journal of Logic and Analysis (Search for Journal in Brave)

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

zbMATH Keywords

law of large numbersMartin-Löf randomnessBernoulli distributionalgorithmic randomness

Mathematics Subject Classification ID

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

Related Items (10)

When does randomness come from randomness? ⋮ PERMUTATIONS OF THE INTEGERS INDUCE ONLY THE TRIVIAL AUTOMORPHISM OF THE TURING DEGREES ⋮ Schnorr randomness for noncomputable measures ⋮ Bayesian definition of random sequences with respect to conditional probabilities ⋮ Conditional probabilities and van Lambalgen's theorem revisited ⋮ Permutations of the Integers Induce only the Trivial Automorphism of the Turing Degrees ⋮ How much randomness is needed for statistics? ⋮ Conditional measure and the violation of van Lambalgen's theorem for Martin-Löf randomness ⋮ On the (dis)similarities between stationary imprecise and non-stationary precise uncertainty models in algorithmic randomness ⋮ Computable Measure Theory and Algorithmic Randomness

This page was built for publication: The probability distribution as a computational resource for randomness testing