Exact Expressions for Some Randomness Tests
From MaRDI portal
Publication:3915691
DOI10.1002/malq.19800262502zbMath0464.60004OpenAlexW2055413037MaRDI QIDQ3915691
Publication date: 1980
Published in: Mathematical Logic Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.19800262502
History of mathematics in the 20th century (01A60) Foundations of probability theory (60A99) Complexity of computation (including implicit computational complexity) (03D15) Theory of computing (68Q99)
Related Items (22)
Energy randomness ⋮ The sum \(2^{KM(x)-K(x)}\) over all prefixes \(x\) of some binary sequence can be infinite ⋮ DEEP CLASSES ⋮ The Kučera-Gács theorem revisited by Levin ⋮ On initial segment complexity and degrees of randomness ⋮ Randomness as an invariant for number representations ⋮ A constructive version of Birkhoff's ergodic theorem for Martin-Löf random points ⋮ Prequential Randomness ⋮ Solovay functions and their applications in algorithmic randomness ⋮ Prefix and plain Kolmogorov complexity characterizations of 2-randomness: simple proofs ⋮ Pure quantum states are fundamental, mixtures (composite states) are mathematical constructions: An argument using algorithmic information theory ⋮ Randomness deficiencies ⋮ Prequential randomness and probability ⋮ Algorithmic tests and randomness with respect to a class of measures ⋮ Kolmogorov complexity and strong approximation of Brownian motion ⋮ Mathematical metaphysics of randomness ⋮ Ergodic theorems for individual random sequences ⋮ Computable randomness and betting for computable probability spaces ⋮ Martin-Löf random quantum states ⋮ Uniform test of algorithmic randomness over a general space ⋮ Kolmogorov Complexity in Perspective Part I: Information Theory and Randomness ⋮ On the relation between descriptional complexity and algorithmic probability
This page was built for publication: Exact Expressions for Some Randomness Tests
