Please use this identifier to cite or link to this item:
https://doi.org/10.1007/11780342_43
| Title: | Degrees of weakly computable reals | Authors: | Ng, K.M. Stephan, F. Wu, G. |
Issue Date: | 2006 | Citation: | Ng, K.M., Stephan, F., Wu, G. (2006). Degrees of weakly computable reals. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 3988 LNCS : 413-422. ScholarBank@NUS Repository. https://doi.org/10.1007/11780342_43 | 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. | Source Title: | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | URI: | http://scholarbank.nus.edu.sg/handle/10635/104556 | ISBN: | 3540354662 | ISSN: | 03029743 | DOI: | 10.1007/11780342_43 |
| Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.