Author： Sunderhauf P.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.151, Iss.1, 1995-11, pp. : 277-294
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
The Kolmogorov complexity of real numbers
By Staiger L.
Theoretical Computer Science, Vol. 284, Iss. 2, 2002-07 ,pp. :
Access to resources
Recommend
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. :
An abstract data type for real numbers
Theoretical Computer Science, Vol. 221, Iss. 1, 1999-06 ,pp. :
On approximate and algebraic computability over the real numbers
Theoretical Computer Science, Vol. 219, Iss. 1, 1999-05 ,pp. :