Computability in Europe 2006
Logical Approaches to Computational Barriers

Print current page  Print this page

Regular Talk:
Degrees of weakly computable reals

Speaker: Keng Meng Ng et. al.
Author(s): Keng Meng Ng, Frank Stephan and Guohua Wu
Presentation: wu.pdf
Slot: Sat, 15:10-15:30, Faraday B (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 Valid HTML 4.01! Valid CSS! eXTReMe Tracker hit counters by