Abstract
Finding a natural meeting ground between the highly developed complexity theory of computer science - with its historical roots in logic and the discrete mathematics of the integers - and the traditional domain of real computation, the more eclectic less foundational field of numerical analysis - with its rich history and longstanding traditions in the continuous mathematics of analysis - presents a compelling challenge. Here we illustrate the issues and pose our perspective toward resolution.
| Original language | English |
|---|---|
| Pages (from-to) | 3-26 |
| Journal | International Journal of Bifurcation and Chaos in Applied Sciences and Engineering |
| Volume | 6 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - Jan 1996 |
Fingerprint
Dive into the research topics of 'Complexity and real computation: A manifesto'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver