Computational complexity of real functions and real numbers

Müller, Norbert Theodor

Computability and complexity of real functions and real numbers are studied in a model where methods of recursive function theory as well as methods of numerical analysis can be used at a very low level of complexity. Topological properties turn out to be important for computational questions as well as for questions of existence of complexity bounds. As an example of application the computational complexity of the roots of real functions is studied with respect to the analytic properties of the functions.

Vorschau

Zitieren

Zitierform:

Müller, Norbert: Computational complexity of real functions and real numbers. Hagen 1986. FernUniversität in Hagen.

Zugriffsstatistik

Gesamt

Volltextzugriffe:
Metadatenansicht:

12 Monate

Volltextzugriffe:
Metadatenansicht:

Rechte

Nutzung und Vervielfältigung:
Alle Rechte vorbehalten

Export

powered by MyCoRe