Roots and Inverse Functions
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.
KeywordsInverse Function Modulus Function Dyadic Rational Oracle Machine Polynomial Modulo
Unable to display preview. Download preview PDF.