The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
Open accessAbstract
We present a model for computation over the reals or an arbitrary (ordered) ring R. In this general setting, we obtain universal machines, partial recursive functions, as well as JVP-complete problems.While our theory reflects the classical over Z (e.g., the computable functions are the recursive functions) it also reflects the special mathematical character of the underlying ring R (e.g., complements of Julia sets provide natural examples of R. E. undecidable sets over the reals) and provides a natural setting for studying foundational issues concerning algorithms in numerical analysis.Introduction.We develop here some ideas for machines and computation over the real numbers R.One motivation for this comes from scientific computation.In this use of the computer, a reasonable idealization has the cost of multiplication independent of the size of the number.This contrasts with the usual theoretical computer science picture which takes into account the number of bits of the numbers.Another motivation is to bring the theory of computation into the domain of analysis, geometry and topology.The mathematics of these subjects can then be put to use in the systematic analysis of algorithms.On the other hand, there is an extensively developed subject of the theory of discrete computation, which we don't wish to lose in our theory.Toward this end we define machines, partial recursive functions, and other objects of study over a ring R. Then in the case where R is the ring of integers Z, we have the same objects (or perhaps equivalent objects) as the classical ones.Computable functions over Z are thus ordinary computable functions.R.E.sets over Z are ordinary R.E.sets.But when the ring is specialized to the real numbers, we have computable functions which are reasonable for the study of algorithms of numerical analysis.R.E.sets over R are no longer countable and include, for example, basins of attraction of complex analytic dynamical systems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The Design and Analysis of Computer Algorithms
Aho, A. V., & Hopcroft, J. E. (1974) · CERN Document Server (European Organization for Nuclear Research) · Cited by 9,403
The complexity of theorem-proving procedures
Cook, S. A. (1971) · Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 · doi:10.1145/800157.805047 · Cited by 6,385
Preparata, F. P., & Shamos, M. I. (1985) · Springer eBooks · doi:10.1007/978-1-4612-1098-6 · Cited by 3,655
Theory of Recursive Functions and Effective Computability.
Feferman, S., & Rogers, H. (1969) · The American Mathematical Monthly · doi:10.2307/2316720 · Cited by 2,788
Computation: Finite and Infinite Machines.
Clarke, D. A., & Minsky, M. L. (1968) · The American Mathematical Monthly · doi:10.2307/2313471 · Cited by 2,583
Theory of Recursive Functions and Effective Computability
Cooper, D. C. (1969) · The Computer Journal · doi:10.1093/comjnl/12.1.28 · Cited by 2,539
Theory of Recursive Functions and Effective Computability
Rogers, J. H. (1987) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,998
A Decision Method for Elementary Algebra and Geometry
Tarski, A. (1998) · Texts and Monographs in Symbolic Computation · doi:10.1007/978-3-7091-9459-1_3 · Cited by 1,643
A Decision Method for Elementary Algebra and Geometry
Tarski, A., & McKinsey, J. C. C. (1951) · University of California Press eBooks · doi:10.1525/9780520348097 · Cited by 1,206
Computability and Unsolvability.
Elgot, C., & Davis, M. (1959) · Mathematical Tables and Other Aids to Computation · doi:10.2307/2002808 · Cited by 980
Cited by
(2015) · Cited by 2,857
The dynamical hypothesis in cognitive science
van Gelder, T. (1998) · Behavioral and Brain Sciences · doi:10.1017/s0140525x98001733 · Cited by 1,331
A Unified Framework for Hybrid Control: Model and Optimal Control Theory
Branicky, M. S., Borkar, V. S., & Mitter, S. K. (1998) · IEEE Transactions on Automatic Control · doi:10.1109/9.654885 · Cited by 1,313
Mathematical problems for the next century
Smale, S. (1998) · The Mathematical Intelligencer · doi:10.1007/bf03025291 · Cited by 1,217
Self-citationQuantum Computation Over Continuous Variables
Lloyd, S., & Braunstein, S. L. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.1784 · Cited by 1,145
Metadata
- Authors
- Blum, L., Shub, M., & Smale, S.
- Venue
- Bulletin of the American Mathematical Society
- Publisher
- American Mathematical Society (AMS)
- Published
- 1989
- Volume
- 21
- Issue
- 1
- Pages
- 1-46
- ISSN
- 0002-9904 (ISSN-L)
- 0273-0979
- 1088-9485
- OpenAlex
- W2071846104
- Cited by
- 1,056
- References
- 26
- FWCI
- 41.73
- Type
- journal article
- Language
- en
- Open access
- diamond
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines. https://app.cochat.ai/papers/10.1090/s0273-0979-1989-15750-9
- The paper
- Blum, L., Shub, M., & Smale, S. (1989). On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines. Bulletin of the American Mathematical Society. https://doi.org/10.1090/s0273-0979-1989-15750-9
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.