Roots and Inverse Functions

  • Ker-I Ko
Part of the Progress in Theoretical Computer Science book series (PTCS)


Computing the roots of a real function is one of the most important problems in numerical computation. A great number of numerical algorithms for computing roots from a given function have been devised. However, most of them work only for functions having certain nice analytical properties. After all, the proof of Corollary 3.3 yields immediately that the roots of a polynomial-time computable real function could be all noncomputable real numbers.


Inverse Function Modulus Function Dyadic Rational Oracle Machine Polynomial Modulo 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Birkhäuser Boston 1991

Authors and Affiliations

  • Ker-I Ko
    • 1
  1. 1.Department of Computer ScienceState University of New York at Stony BrookStony BrookUSA

Personalised recommendations