A Theory of Computation and Complexity Over the Real Numbers

TitleA Theory of Computation and Complexity Over the Real Numbers
Publication TypeTechnical Report
Year of Publication1990
AuthorsBlum, L.
Other Numbers622
Abstract

The classical theory of computation and complexity presupposes all underlying spaces are countable and hence ipso facto cannot handle arbitrary sets of real or complex numbers. Thus e.g., Penrose (1990) acknowledges the difficulty of formulating classically his question: Is the Mandelbrot set recursive? On the other hand, this as well as a number of other inherent questions of decidability and computability over the reals or complex number can be naturally posed and settled within the framework presented in this paper.

URLhttp://www.icsi.berkeley.edu/pubs/techreports/tr-90-058.pdf
Bibliographic Notes

ICSI Technical Report TR-90-058

Abbreviated Authors

L. Blum

ICSI Publication Type

Technical Report