论文信息 - On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals

On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals

Let \(\alpha \) and \(\beta \) be (Martin-Lof) random left-c.e. reals with left-c.e. approximations \(\{\alpha _s\}_{s\in \omega }\) and \(\{\beta _s\}_{s\in \omega }\).

Joseph S. Miller | Joseph S. Miller

[1] André Nies,et al. Randomness, Computability, and Density , 2001, STACS.

[2] A. Nies. Computability and randomness , 2009 .

[3] Bakhadyr Khoussainov,et al. Recursively enumerable reals and Chaitin Ω numbers , 1998 .

[4] Xizhong Zheng,et al. Solovay Reducibility on D-c.e Real Numbers , 2005, COCOON.

[5] Antonín Kucera,et al. Randomness and Recursive Enumerability , 2001, SIAM J. Comput..

[6] Rodney G. Downey,et al. Algorithmic Randomness and Complexity , 2010, Theory and Applications of Computability.

[7] Gregory J. Chaitin,et al. A recent technical report , 1974, SIGA.

[8] Alexander Raichev,et al. Relative randomness and real closed fields , 2005, Journal of Symbolic Logic.

[9] Denis R. Hirschfeldt,et al. Algorithmic randomness and complexity. Theory and Applications of Computability , 2012 .

[10] Xizhong Zheng,et al. On the Extensions of Solovay-Reducibility , 2004, COCOON.

[11] Klaus Weihrauch,et al. Weakly Computable Real Numbers , 2000, J. Complex..

[12] Ng Keng Meng. SOME PROPERTIES OF D.C.E. REALS AND THEIR DEGREES , 2005 .