Computational complexity of real functions

132Citations
Citations of this article
25Readers
Mendeley users who have this article in their library.

Abstract

Recursive analysis, the theory of computation of functions on real numbers, has been studied from various aspects. We investigate the computational complexity of real functions using the methods of recursive function theory. Partial recursive real functions are defined and their domains are characterized as the recursively open sets. We define the time complexity of recursive real continuous functions and show that the time complexity and the modulus of uniform continuity of a function are closely related. We study the complexity of the roots and the differentiability of polynomial time computable real functions. In particular, a polynomial time computable real function may have a root of arbitrarily high complexity and may be nowhere differentiable. The concepts of the space complexity and nondeterministic computation are used to study the complexity of the integrals and the maximum values of real functions. These problems are shown to be related to the “P=?NP” and the “P=?PSPACE” questions. © 1982, North-Holland Publishing Company All rights reserved. All rights reserved.

Cite

CITATION STYLE

APA

Ko, K. I., & Friedman, H. (1982). Computational complexity of real functions. Theoretical Computer Science, 20(3), 323–352. https://doi.org/10.1016/S0304-3975(82)80003-0

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free