Computability in Europe 2006
Logical Approaches to Computational Barriers

Regular Talk:
Degrees of weakly computable reals

Speaker: Keng Meng Ng et. al.
Author(s): Keng Meng Ng, Frank Stephan and Guohua Wu
Slot: Array, 15:10-15:30, col. 1


Downey, Wu and Zheng proved that there is a degree below 0' containing
no weakly computable reals. In this paper, we prove a stronger result,
saying that there exists a nonzero degree below 0' such that every
nonzero degree below it contains no weakly computable reals. We also
study those degrees containing only weakly computable reals, and give a
new characterization of array recursive degrees. 

websites: Arnold Beckmann 2006-06-23