On a theory of computation over the real numbers; NP completeness, recursive functions and universal machines

Similar Works

Action	Title	Year	Authors
+	On a Theory of Computation over the Real Numbers; NP Completeness, Recursive Functions and Universal Machines (Extended Abstract)	1988	Lenore Blum M. Shub Steve Smale
+ PDF Chat	On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines	1989	Lenore Blum M. Shub Steve Smale
+ PDF Chat	Ordered subrings of the reals in which output sets are recursively enumerable	1993	Robert E. Byerly
+	A Framework for Algebraic Characterizations in Recursive Analysis	2016	Olivier Bournez Walid Gomaa Emmanuel Hainry
+	Models of computability of partial functions on the reals	2007	Ming Quan Fu
+	Propiedades básicas de los números computables	2006	Carlos Mario Parra Johany A. Suárez
+	Real functions and numbers defined by Turing machines	1983	Rudolf Freund
+	Characterization of semicomputable sets, and computable partial functions,on the real plane	2014	Ming Quan Fu
+	Recursive Analysis Characterized as a Class of Real Recursive Functions	2006	Olivier Bournez Emmanuel Hainry
+	Computability: An Introduction to Recursive Function Theory	1980	Nigel J. Cutland
+	Relativizations of the P=?NP question over the reals (and other ordered rings)	1994	T. Emerson
+	Models of computation for partial functions on the reals	2014	Ming Quan Fu J. I. Zucker
+	Computable functions	1980	Nigel J. Cutland
+ PDF Chat	Ordered rings over which output sets are recursively enumerable sets	1991	Christian Michaux
+	Recursively enumerable subsets of Rq in two computing models Blum-Shub-Smale machine and Turing machine	1998	Ning Zhong
+	Recursive and recursively enumerable sets	1980	Nigel J. Cutland
+	Universally Closed Classes of Total Computable Functions	1984	Robert L. Constable
+ PDF Chat	The elementary computable functions over the real numbers: applying two new techniques	2007	Manuel L. Campagnolo Kerry Ojakian
+ PDF Chat	Ordered Rings Over Which Output Sets are Recursively Enumerable Sets	1991	Christian Michaux
+	A domain-theoretic approach to computability on the real line	1999	Abbas Edalat Philipp Sünderhauf

Works That Cite This (25)

Action	Title	Year	Authors
+ PDF Chat	The irrationals are not recursively enumerable	1990	Richard Mansfield
+	A recursion theoretic foundation of computation over real numbers	2020	Keng Meng Ng Nazanin R. Tavana Yue Yang
+	Global dynamics in neural networks. III	2002	Fernanda Botelho Max Garzón
+ PDF Chat	Computing the Partition Function of the Sherrington-Kirkpatrick Model is Hard on Average	2020	David Gamarnik Eren C. Kızıldağ
+	Computing the partition function of the Sherrington-Kirkpatrick model is hard on average	2018	David Gamarnik Eren C. Kızıldağ
+	Computing the partition function of the Sherrington-Kirkpatrick model is hard on average	2018	David Gamarnik Eren C. Kızıldağ
+	On genuinely time bounded computations	2005	Friedhelm Meyer auf der Heide
+	Bibliography	1997	Yinyu Ye
+	Fast exact algorithms for optimization problems in resource allocation and switched linear systems	2019	Zeyang Wu
+ PDF Chat	A probabilistic algorithm to compute the real dimension of a semi-algebraic set	2013	Mohab Safey El Din Elias Tsigaridas

Works Cited by This (16)

Action	Title	Year	Authors
+	Computational complexity of real functions	1982	Ker‐I Ko Harvey M. Friedman
+	Diophantine sets over polynomial rings	2015	Martin Davis Hilary Putnam
+	Proving simultaneous positivity of linear forms	1972	Michael O. Rabin
+	Diophantine Sets Over Z[ T ]	1978	Jan Denef
+ PDF Chat	Arithmetic on curves	1986	Barry Mazur
+	Complex analytic dynamics on the Riemann sphere	1984	Paul Blanchard
+ PDF Chat	Invariant sets under iteration of rational functions	1965	Hans Brolin
+ PDF Chat	The Diophantine problem for polynomial rings and fields of rational functions	1978	J. Denef
+ PDF Chat	On the real spectrum of a ring and its application to semialgebraic geometry	1986	Eberhard Becker
+	A Theory on Extending Algorithms for Parametric Problems	1989	B. Curtis Eaves Uriel G. Rothblum