On a Theory of Computation and Complexity over the Real Numbers: NP-Completeness, Recursive Functions and Universal Machines
Citation
L. Blum and M. Shub and S. Smale. (1989). On a Theory of Computation and Complexity over the Real Numbers: NP-Completeness, Recursive Functions and Universal Machines. Bulletin of the American Mathematical Society. 21(1). pp. 1–46.
Why this reference is included
Blum et al.’s On a Theory of Computation and Complexity over the Real Numbers: NP-Completeness, Recursive Functions and Universal Machines (1989) is part of the program’s reference corpus as standard domain context for Computation and Complexity. It is not directly cited in the currently published volumes of Panta Rhei, but is retained as part of the research shelf.
Corpus status
In the corpus only This reference is part of the research corpus but is not directly cited in the currently published volumes of Panta Rhei.