Abstract
In this paper a definition of computability and complexity of real functions and real numbers is given which is open to methods of recursive function theory as well as to methods of numerical analysis. As an example of application we study the computational complexity of roots and thereby establish a subpolynomial hierarchy of real closed fields.
Cite
CITATION STYLE
APA
Müller, N. T. (1986). Subpolynomial complexity classes of real functions and real numbers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 226 LNCS, pp. 284–293). Springer Verlag. https://doi.org/10.1007/3-540-16761-7_78
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free