An Analog Characterization of the Subrecursive Functions

We study a restricted version of Shannon's General Purpose Analog Computer in which we only allow the machine to solve linear differential equations. This corresponds to only allowing local feedback in the machine's variables. We show that if this computer is allowed to sense inequalities in a differentiable way, then it can compute exactly the elementary functions. Furthermore, we show that if the machine has access to an oracle which computes a function f(x) with a suitable growth as x goes to infinity, then it can compute functions on any given level of the Grzegorczyk hierarchy. More precisely, we show that the model contains exactly the nth level of the Grzegorczyk hierarchy if it is allowed to solve n-3 non-linear differential equations of a certain kind. Therefore, we claim that there is a close connection between analog complexity classes, and the dynamical systems that compute them, and classical sets of subrecursive functions.

[1]  Cristopher Moore,et al.  Iteration, Inequalities, and Differentiability in Analog Computers , 2000, J. Complex..

[2]  S. Smale,et al.  On a theory of computation and complexity over the real numbers; np-completeness , 1989 .

[3]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[4]  P. Hartman.  Ordinary Differential Equations , 1965 .

[5]  H. E. Rose.  Subrecursion: Functions and Hierarchies , 1984 .

[6]  Klaus Meer.  Real Number Models under Various Sets of Operations , 1993, J. Complex..

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

[8]  A. Grzegorczyk.  Some classes of recursive functions , 1964 .

[9]  Olivier Bournez.  Achilles and the Tortoise Climbing up the Hyper-Arithmetical Hierarchy , 1999, Theor. Comput. Sci..

[10]  Andrzej Grzegorczyk.  On the definition of computable functionals , 1955 .

[11]  Pekka Orponen,et al.  A Survey of Continous-Time Computation Theory , 1997, Advances in Algorithms, Languages, and Complexity.

[12]  Pekka Orponen,et al.  The Computational Power of Continuous Time Neural Networks , 1997, SOFSEM.

[13]  Geo. A. Miller.  Royal Society of London , 1910, Nature.

[14]  S. Smale,et al.  On a theory of computation and complexity over the real numbers; np-completeness , 1989 .

[15]  Mark D. Bowles,et al.  U.S. Technological Enthusiasm and British Technological Skepticism in the Age of the Analog Brain , 1996, IEEE Ann. Hist. Comput..

[16]  H. Siegelmann,et al.  Analog computation with dynamical systems , 1998 .

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

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

[19]  Moore,et al.  Unpredictability and undecidability in dynamical systems. , 1990, Physical review letters.

[20]  A. Grzegorczyk.  On the definitions of computable real continuous functions , 1957 .

[21]  Marian Boykan Pour-El,et al.  Computability in analysis and physics , 1989, Perspectives in Mathematical Logic.

[22]  William Thomson.  IV. On an instrument for calculating (∫φ(x) ψ (x)dx), the integral of the product of two given functions , 1876, Proceedings of the Royal Society of London.

[23]  Vladimir Igorevich Arnolʹd,et al.  Équations différentielles ordinaires , 1974 .

[24]  Michael S. Branicky,et al.  Universal Computation and Other Capabilities of Hybrid and Continuous Dynamical Systems , 1995, Theor. Comput. Sci..

[25]  Hava T. Siegelmann,et al.  Neural networks and analog computation - beyond the Turing limit , 1999, Progress in theoretical computer science.

[26]  N. Cutland.  Computability: An Introduction to Recursive Function Theory , 1980 .

[27]  Claude E. Shannon,et al.  Mathematical Theory of the Differential Analyzer , 1941 .

[28]  Rozsa Peter.  Review: Andrzej Grzegorczyk, Some Classes of Recursive Functions , 1955 .

[29]  Cristopher Moore,et al.  Dynamical Recognizers: Real-Time Language Recognition by Analog Computers , 1998, Theor. Comput. Sci..