A survey of transcendentally transcendental functions
American Mathematical Monthly
Complexity theory of real functions
Complexity theory of real functions
Universal computation and other capabilities of hybrid and continuous dynamical systems
Theoretical Computer Science - Special issue on hybrid systems
Recursion theory on the reals and continuous-time computation
Theoretical Computer Science - Special issue on real numbers and computers
Closed-form analytic maps in one and two dimensions can simulate universal Turing machines
Theoretical Computer Science - Special issue on real numbers and computers
Neural networks and analog computation: beyond the Turing limit
Neural networks and analog computation: beyond the Turing limit
Computable analysis: an introduction
Computable analysis: an introduction
Iteration, inequalities, and differentiability in analog computers
Journal of Complexity
Analog computers and recursive functions over the reals
Journal of Complexity
Real recursive functions and their hierarchy
Journal of Complexity
Recursive Analysis Characterized as a Class of Real Recursive Functions
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
Robust simulations of turing machines with analytic maps and flows
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Computability of analog networks
Theoretical Computer Science
The New Promise of Analog Computation
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Abstract Geometrical Computation and the Linear Blum, Shub and Smale Model
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Hi-index | 0.00 |
In this paper we revisit one of the first models of analog computation, Shannon’s General Purpose Analog Computer (GPAC). The GPAC has often been argued to be weaker than computable analysis. As main contribution, we show that if we change the notion of GPAC-computability in a natural way, we compute exactly all real computable functions (in the sense of computable analysis). Moreover, since GPACs are equivalent to systems of polynomial differential equations then we show that all real computable functions can be defined by such models.