Computation by dynamical systems

A theory for computation by dynamical systems is presented, definition of computation time that is applicable for systems that are continuous as well as for systems that are discrete in time, based on a physical time scale is introduced. Computational complexity of dynamical systems is explored. For this purpose the standard classes of computer science are adapted to dynamical systems. The complexity classes P/sub d/, BPP/sub d/ and NP/sub d/ corresponding to the standard classes P, BPP and NP are defined for the case of more physical dynamics. It is then shown that computation of a simple fixed point is in P/sub d/ or BPP/sub d/ (depending on the output decision process) while for an isolated strange attractor it is in NP/sub d/. The computation by the continuous Hopfield neural network is analyzed in detail and found to be in P/sub d/ or in BPP/sub d/.

[1]  Grebogi,et al.  Map with more than 100 coexisting low-period periodic attractors. , 1996, Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics.

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

[3]  M. Branicky.  Topology of hybrid systems , 1993, Proceedings of 32nd IEEE Conference on Decision and Control.

[4]  Hava T. Siegelmann,et al.  Analog computation via neural networks , 1993, [1993] The 2nd Israel Symposium on Theory and Computing Systems.

[5]  Lee A. Rubel,et al.  The Extended Analog Computer , 1993 .

[6]  Hava T. Siegelmann,et al.  On the computational power of neural nets , 1992, COLT '92.

[7]  Lee A. Rubel,et al.  Digital simulation of analog computation and Church's thesis , 1989, Journal of Symbolic Logic.

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

[9]  J. Yorke,et al.  Chaos, Strange Attractors, and Fractal Basin Boundaries in Nonlinear Dynamics , 1987, Science.

[10]  D. Deutsch.  Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[11]  Ker-I Ko,et al.  On the Computational Complexity of Ordinary Differential Equations , 1984, Inf. Control..

[12]  J J Hopfield,et al.  Neurons with graded response have collective computational properties like those of two-state neurons. , 1984, Proceedings of the National Academy of Sciences of the United States of America.

[13]  L. Rubel.  A universal differential equation , 1981 .

[14]  M. B. Pour-El,et al.  Abstract computability and its relation to the general purpose analog computer (some connections between logic, differential equations and analog computers) , 1974 .

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

[16]  R. Penrose,et al.  Shadows of the Mind , 1994 .