Abstract
Using possibly infinite computations on universal monotone Turing machines, we prove Martin-Löf randomness in ∅' of the probability that the output be in some set 𝒪⊆2≤ω under complexity assumptions about 𝒪.
Citation
Verónica Becher. Serge Grigorieff. "Random reals and possibly infinite computations Part I: Randomness in ∅'." J. Symbolic Logic 70 (3) 891 - 913, September 2005. https://doi.org/10.2178/jsl/1122038919
Information
