scientific article; zbMATH DE number 1531917
From MaRDI portal
Publication:4513960
zbMath0962.03039MaRDI QIDQ4513960
Antonín Kučera, Ambos-Spies, Klaus
Publication date: 19 November 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
algorithmic randomnessTuring degreesoraclesrelativized randomnessMartin-Löf random setscomputably random sequence
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Applications of computability and recursion theory (03D80) Other Turing degree structures (03D28)
Related Items
Randomness and reducibility, On Kurtz randomness, Comparing notions of randomness, The smallest probability interval a sequence is random for: a study for six types of randomness, Turing incomparability in Scott sets, RANDOMNESS NOTIONS AND REVERSE MATHEMATICS, The Kolmogorov-Loveland stochastic sequences are not closed under selecting subsequences, The complexity of stochastic sequences, Schnorr Randomness, Trivial Reals, Approximation representations for \(\Delta_2\) reals, Lowness Properties of Reals and Hyper-Immunity, Regular reals, A universal pair of 1/2-betting strategies, Randomness is inherently imprecise, Kolmogorov-Loveland randomness and stochasticity, On the (dis)similarities between stationary imprecise and non-stationary precise uncertainty models in algorithmic randomness
