On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- 1 January 1989
- journal article
- Published by American Mathematical Society (AMS) in Bulletin of the American Mathematical Society
- Vol. 21 (1), 1-46
- https://doi.org/10.1090/s0273-0979-1989-15750-9
Abstract
References [Enhancements On Off] (What's this?)Keywords
This publication has 44 references indexed in Scilit:
- Register machine proof of the theorem on exponential diophantine representation of enumerable setsThe Journal of Symbolic Logic, 1984
- Complex analytic dynamics on the Riemann sphereBulletin of the American Mathematical Society, 1984
- Computability and Noncomputability in Classical AnalysisTransactions of the American Mathematical Society, 1983
- Lower bounds for algebraic decision treesJournal of Algorithms, 1982
- The Diophantine Problem for Polynomial Rings and Fields of Rational FunctionsTransactions of the American Mathematical Society, 1978
- Diophantine Sets Over Z[ T ]Proceedings of the American Mathematical Society, 1978
- Computation: Finite and Infinite Machines.The American Mathematical Monthly, 1968
- On the Betti Numbers of Real VarietiesProceedings of the American Mathematical Society, 1964
- Computability of Recursive FunctionsJournal of the ACM, 1963
- Computable Algebra, General Theory and Theory of Computable FieldsTransactions of the American Mathematical Society, 1960