Recursively enumerable subsets of Rq in two computing models Blum-Shub-Smale machine and Turing machine
Author:
- 15 May 1998
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 197 (1-2) , 79-94
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Topological complexity of a root finding algorithmJournal of Complexity, 1989
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989
- Computational complexity of real functionsTheoretical Computer Science, 1982
- Computable functionalsFundamenta Mathematicae, 1955