Author： Beklemishev L.D.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.224, Iss.1, 1999-08, pp. : 13-33
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
On the linearity of on-line computable functions
Theoretical Computer Science, Vol. 162, Iss. 1, 1996-08 ,pp. :
Access to resources
Recommend
Effectively closed sets and graphs of computable real functions
Theoretical Computer Science, Vol. 284, Iss. 2, 2002-07 ,pp. :
Recursive characterization of computable real-valued functions and relations
By Brattka V.
Theoretical Computer Science, Vol. 162, Iss. 1, 1996-08 ,pp. :
Real functions computable by finite automata using affine representations
By Konecny
Theoretical Computer Science, Vol. 284, Iss. 2, 2002-07 ,pp. :