Recursively Enumerable Reals and Chaitin Ω Numbers

by Cristian S. Calude , Peter H. Hertling , Bakhadyr Khoussainov , Yongge Wang
Citations:34 - 3 self

Active Bibliography

Recursivelyenumerable reals and Chaitin www.elsevier.com/locate/tcs numbers �;�� – Cristian S. Calude, Peter H. Hertling, Bakhadyr Khoussainov, Yongge Wang - 1998
6 A Glimpse into Algorithmic Information Theory – Cristian S. Calude, Cristian S. Calude - 1999
20 Computing a glimpse of randomness – Cristian S. Calude, Michael J. Dinneen, Chi-kou Shu
11 Complexity and Randomness – Sebastiaan A. Terwijn - 2003
38 Randomness, relativization, and Turing degrees – Andre Nies, Frank Stephan, Sebastiaan A. Terwijn - 2005
5 The Kolmogorov Complexity of Random Reals – Liang Yu, Decheng Ding, Nanjing Jiang Su, Rodney Downey - 2003
Who Is Afraid of Randomness? – C.S. Calude, Cristian S. Calude, Ivar Ekeland - 2000
21 Randomness Space – Peter Hertling, Peter Hertling, Klaus Weihrauch, Klaus Weihrauch, Theoretische Informatik I - 1998
2 Relative Randomness via RK-Reducibility – Alexander Raichev, Wendell Berry - 2006
12 Computational depth and reducibility – David W. Juedes, James I. Lathrop, Jack H. Lutz - 1994
25 Some Computability-Theoretical Aspects of Reals and Randomness – Rodney G. Downey - 2001
57 Trivial Reals – Rod G. Downey, et al.
21 Relativizing Chaitin’s halting probability – Rod Downey, Denis R. Hirschfeldt, Joseph S. Miller, André Nies
5 Feasible Reductions to Kolmogorov-Loveland Stochastic Sequences – Jack H. Lutz, David L. Schweizer - 1999
10 A Characterization of C.E. Random Reals – Cristian S. Calude - 1999
28 Randomness in Computability Theory – Klaus Ambos-spies, Antonín Kucera - 2000
17 Chaitin Ω Numbers, Solovay Machines, and Incompleteness – Cristian S. Calude - 1999
18 Recursive computational depth – James I. Lathrop, Jack H. Lutz - 1999
The Classes of Algorithmically Random Reals – Stephanie Reid - 2003