Author： Cenzer D. Remmel J.B.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.284, Iss.2, 2002-07, pp. : 279-318
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Recursive characterization of computable real-valued functions and relations
By Brattka V.
Theoretical Computer Science, Vol. 162, Iss. 1, 1996-08 ,pp. :
Access to resources
Recommend
Real functions computable by finite automata using affine representations
By Konecny
Theoretical Computer Science, Vol. 284, Iss. 2, 2002-07 ,pp. :
Index sets in computable analysis
Theoretical Computer Science, Vol. 219, Iss. 1, 1999-05 ,pp. :
Isomorphism theorem for BSS recursively enumerable sets over real closed fields
Theoretical Computer Science, Vol. 231, Iss. 2, 2000-01 ,pp. :