Random Reals and Possibly . . .

by Verónica Becher , Serge Grigorieff

@MISC{Becher_randomreals,
    author = {Verónica Becher and Serge Grigorieff},
    title = {Random Reals and Possibly . . . },
    year = {}
}

274	A Theory of Program Size Formally Identical to Information Theory - Chaitin - 1975
264	Algorithmic Information Theory - Chaitin - 1987
210	Adherences of languages - Boasson, Nivat
41	On partial randomness - Calude, Staiger, et al.
28	Recursively enumerable reals and Chaitin Ω numbers, Theoret - Calude, Hertling, et al.
25	Some Computability-Theoretical Aspects of Reals and - Downey
15	A highly random number - Becher, Chaitin, et al. - 2001
15	Algorithmic entropy of sets - Chaitin - 1976
8	Random reals and possibly infinite computations. Part I: randomness in - Becher, Grigorieff
5	Another example of higher order randomness - Becher, Chaitin
1	Wadge semireducibility with lower semicontinuous maps into 2 ≤ω - Becher, Grigorieff
1	Recursion and topology on 2 ≤ω for possibly infinite computations. Theoret - Becher, Grigorieff