Some recent developments on Shannon's General Purpose Analog Computer
- 18 August 2004
- journal article
- conference paper
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 50 (4-5) , 473-485
Abstract
This paper revisits one of the first models of analog computation, the General Purpose Analog Computer (GPAC). In particular, we restrict our attention to the improved model presented in [11] and we show that it can be further refined. With this we prove the following: (i) the previous model can be simplified; (ii) it admits extensions having close connections with the class of smooth continuous time dynamical systems. As a consequence, we conclude that some of these extensions achieve Turing universality. Finally, it is shown that if we introduce a new notion of computability for the GPAC, based on ideas from computable analysis, then one can compute transcendentally transcendental functions such as the Gamma function or Riemann's Zeta function.Keywords
This publication has 27 references indexed in Scilit:
- Closed-form analytic maps in one and two dimensions can simulate universal turing machinesTheoretical Computer Science, 1999
- Recursion theory on the reals and continuous-time computationTheoretical Computer Science, 1996
- Where are we going, Phil Morse? Changing agendas and the rhetoric of obviousness in the transformation of computing at MIT, 1939-1957IEEE Annals of the History of Computing, 1996
- On the role of mathematics and mathematical knowledge in the invention of Vannevar Bush's early analog computersIEEE Annals of the History of Computing, 1996
- U.S. technological enthusiasm and British technological skepticism in the age of the analog brainIEEE Annals of the History of Computing, 1996
- Computability with low-dimensional dynamical systemsTheoretical Computer Science, 1994
- Theory of computation1992
- A Survey of Transcendentally Transcendental FunctionsThe American Mathematical Monthly, 1989
- A Differentially Algebraic Replacement Theorem, and Analog ComputabilityProceedings of the American Mathematical Society, 1987
- Abstract computability and its relation to the general purpose analog computer (some connections between logic, differential equations and analog computers)Transactions of the American Mathematical Society, 1974