Computational complexity on computable metric spaces

✍ Scribed by Klaus Weirauch

• Publisher: John Wiley and Sons
• Year: 2003
• Tongue: English
• Weight: 344 KB
• Volume: 49
• Category: Article
• ISSN: 0044-3050
• DOI: 10.1002/malq.200310001

✦ Synopsis

Abstract

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 [19] et al. Although this definition of TIME as the maximum of a generally infinite family of numbers looks straightforward, at first glance, examples for which this maximum exists seem to be very rare. It is the main purpose of this paper to prove that, nevertheless, the definition has a large number of important applications. Using the framework of TTE [40], we introduce computable metric spaces and computability on the compact subsets. We prove that every computable metric space has a c‐proper c‐admissible representation. We prove that Turing machine time complexity of a function computable relative to c‐admissible c‐proper representations has a computable bound on every computable compact subset. We prove that computably compact computable metric spaces have concise c‐proper c‐admissible representations and show by examples that many canonical representations are of this kind. Finally, we compare our definition with a similar one by Labhalla et al. [22]. Several examples illustrate the concepts. By these results natural and realistic definitions of computational complexity are now available for a variety of numerical problems such as image processing, integration, continuous Fourier transform or wave propagation.