On Schnorr and computable randomness, martingales, and machines
From MaRDI portal
Publication:3159418
DOI10.1002/malq.200310121zbMath1062.68064OpenAlexW2117944581MaRDI QIDQ3159418
Evan J. Griffiths, Rodney G. Downey, Geoffrey L. LaForte
Publication date: 16 February 2005
Published in: MLQ (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/malq.200310121
Kolmogorov complexitymartingaleSchnorr randomnessChaitin's Omega numberprefix-free machinesSchnorr machines
Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Complexity of computation (including implicit computational complexity) (03D15) Recursively (computably) enumerable sets and degrees (03D25)
Related Items (15)
On Kurtz randomness ⋮ CHARACTERIZING LOWNESS FOR DEMUTH RANDOMNESS ⋮ Strength and Weakness in Computable Structure Theory ⋮ Schnorr trivial reals: a construction ⋮ On effectively closed sets of effective strong measure zero ⋮ Truth-table Schnorr randomness and truth-table reducible randomness ⋮ Schnorr trivial sets and truth-table reducibility ⋮ Schnorr Trivial Reals: A construction ⋮ Schnorr triviality and genericity ⋮ Hyperimmune-free degrees and Schnorr triviality ⋮ Monotonous betting strategies in warped casinos ⋮ Computable randomness and betting for computable probability spaces ⋮ Calibrating Randomness ⋮ Unified characterizations of lowness properties via Kolmogorov complexity ⋮ Schnorr triviality and its equivalent notions
This page was built for publication: On Schnorr and computable randomness, martingales, and machines
