Rational vs. Real Computation

[1]  Walid Gomaa.  Polynomial Time Computation in the Context of Recursive Analysis , 2009, FOPARA.

[2]  Daniel Silva Graça,et al.  Some recent developments on Shannon's General Purpose Analog Computer , 2004, Math. Log. Q..

[3]  Manuel Lameiras Campagnolo,et al.  The elementary computable functions over the real numbers: applying two new techniques , 2008, Arch. Math. Log..

[4]  Xizhong Zheng,et al.  A Computability Theory of Real Numbers , 2006, CiE.

[5]  Ker-I Ko,et al.  Complexity Theory of Real Functions , 1991, Progress in Theoretical Computer Science.

[6]  José Félix Costa,et al.  Analog computers and recursive functions over the reals , 2003, J. Complex..

[7]  Klaus Weihrauch,et al.  Computable Analysis: An Introduction , 2014, Texts in Theoretical Computer Science. An EATCS Series.

[8]  L. Rubel,et al.  A differentially algebraic replacement theorem, and analog computability , 1987 .

[9]  Stephen A. Cook,et al.  A new recursion-theoretic characterization of the polytime functions , 1992, STOC '92.

[10]  P. Odifreddi.  Classical recursion theory , 1989 .

[11]  Jerzy Mycka,et al.  Real recursive functions and their hierarchy , 2004, J. Complex..

[12]  Cristopher Moore,et al.  Recursion Theory on the Reals and Continuous-Time Computation , 1996, Theor. Comput. Sci..

[13]  Cristopher Moore,et al.  Upper and Lower Bounds on Continuous-Time Computation , 2000, UMC.

[14]  Klaus Weihrauch,et al.  Computability on the Probability Measureson the Borel Sets of the Unit Interval , 1999, Theor. Comput. Sci..

[15]  A. Turing.  On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .

[16]  Ingo Wegener,et al.  Complexity Theory , 2005 .

[17]  Walid Gomaa.  Characterizing Polynomial Time Computability of Rational and Real Functions , 2009, DCM.

[18]  Manuel L. Campagnolo,et al.  Computational complexity of real valued recursive functions and analog circuits , 2001 .

[19]  Christoph Kreitz,et al.  Theory of Representations , 1985, Theor. Comput. Sci..

[20]  Stephen Smale,et al.  On a theory of computation over the real numbers; NP completeness, recursive functions and universal machines , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[21]  Olivier Bournez,et al.  Recursive Analysis Characterized as a Class of Real Recursive Functions , 2006, Fundam. Informaticae.

[22]  C. Michaux,et al.  A survey on real structural complexity theory , 1997 .