Abstract
This paper studies the degrees of weakly computable reals. It is shown that certain types of limit-recursive reals are Turing incomparable to all weakly computable reals except the recursive and complete ones. Furthermore, it is shown that an r.e. Turing degree is array-recursive iff every real in it is weakly computable. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
APA
Ng, K. M., Stephan, F., & Wu, G. (2006). Degrees of weakly computable reals. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3988 LNCS, pp. 413–422). Springer Verlag. https://doi.org/10.1007/11780342_43
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free