Author： Di Gianantonio P.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.221, Iss.1, 1999-06, pp. : 295-326
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
Theoretical Computer Science, Vol. 173, Iss. 2, 1997-02 ,pp. :
Access to resources
Recommend
The Kolmogorov complexity of real numbers
By Staiger L.
Theoretical Computer Science, Vol. 284, Iss. 2, 2002-07 ,pp. :
PCF extended with real numbers
By Escardo M.H.
Theoretical Computer Science, Vol. 162, Iss. 1, 1996-08 ,pp. :
Towards faster real algebraic numbers
By Rioboo R.
Journal of Symbolic Computation, Vol. 36, Iss. 3, 2003-09 ,pp. :
A faithful computational model of the real numbers
Theoretical Computer Science, Vol. 151, Iss. 1, 1995-11 ,pp. :