Author： Brattka V.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.210, Iss.1, 1999-01, pp. : 3-20
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
Index sets in computable analysis
Theoretical Computer Science, Vol. 219, Iss. 1, 1999-05 ,pp. :
Access to resources
Recommend
Descriptive complexity of computable sequences
By Durand B. Shen A. Vereshchagin
Theoretical Computer Science, Vol. 271, Iss. 1, 2002-01 ,pp. :
Foundation of a computable solid modelling
Theoretical Computer Science, Vol. 284, Iss. 2, 2002-07 ,pp. :
Computable concurrent processes
Theoretical Computer Science, Vol. 139, Iss. 1, 1995-03 ,pp. :
On the linearity of on-line computable functions
Theoretical Computer Science, Vol. 162, Iss. 1, 1996-08 ,pp. :