1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://doi.org/10.1007/11780342_43
DC FieldValue
dc.titleDegrees of weakly computable reals
dc.contributor.authorNg, K.M.
dc.contributor.authorStephan, F.
dc.contributor.authorWu, G.
dc.date.accessioned2014-10-28T02:50:51Z
dc.date.available2014-10-28T02:50:51Z
dc.date.issued2006
dc.identifier.citationNg, 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
dc.identifier.isbn3540354662
dc.identifier.issn03029743
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/104556
dc.description.abstractThis 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.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1007/11780342_43
dc.sourceScopus
dc.typeConference Paper
dc.contributor.departmentMATHEMATICS
dc.description.doi10.1007/11780342_43
dc.description.sourcetitleLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.description.volume3988 LNCS
dc.description.page413-422
dc.identifier.isiut000239424100043
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.