All reports by Author Klaus Weihrauch:

__
TR02-014
| 10th December 2001
__

Klaus Weihrauch#### Computational Complexity on Computable Metric Spaces

Revisions: 1

Klaus Weihrauch

We introduce a new Turing machine based concept of time complexity for functions on computable metric spaces. It generalizes the ordinary complexity of word functions and the complexity of real functions studied by Ko \cite{Ko91} et al. Although this definition of ${\rm TIME}$ as the maximum of a generally infinite ... more >>>