Random reals and possibly infinite computations Part I: Randomness in ∅′
Verónica Becher, Serge Grigorieff · Journal of Symbolic Logic · 2005
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 under complexity assumptions about .