Coupled map lattices as computational systems.

The coupled map lattice (CML) as a mathematical model for a computer is considered. Using the theory of synchronous concurrent algorithms, it is shown that the CML is a valid new model for a parallel deterministic analog machine, but that, in principle, such a CML computer does not generate computations that cannot be reproduced by the standard mathematical models for computing on real numbers. The analysis is based on new general mathematical definitions of CMLs, and an axiomatic approach to determining which models of computation can be used to simulate CMLs.

[1]  John C. Shepherdson,et al.  On the Definition of Computable Function of a Real Variable , 1976, Math. Log. Q..

[2]  Kunihiko Kaneko,et al.  Globally coupled circle maps , 1991 .

[3]  Alan F. Beardon,et al.  Iteration of Rational Functions , 1991 .

[4]  J. V. Tucker,et al.  The concurrent assignment representation of synchronous systems , 1989, Parallel Comput..

[5]  Stability of spatially homogeneous chaotic regimes in unidirectional chains , 1990 .

[6]  R. Devaney.  An Introduction to Chaotic Dynamical Systems , 1990 .

[7]  K. Kaneko.  Mean field fluctuation of a network of chaotic elements: Remaining fluctuation and correlation in the large size limit , 1992 .

[8]  Oliver Aberth,et al.  Computable analysis , 1980 .

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

[10]  Mario Markus,et al.  Nonlinear wave processes in excitable media , 1991 .

[11]  F. L. Bauer.  Logic, Algebra, and Computation , 1991, NATO ASI Series.

[12]  K. Kaneko.  Clustering, coding, switching, hierarchical ordering, and control in a network of chaotic elements , 1990 .

[13]  Hugues Chaté,et al.  Spatio-temporal intermittency in coupled map lattices , 1988 .

[14]  P. Odifreddi.  The theory of functions and sets of natural numbers , 1989 .

[15]  Robin Milner,et al.  The Polyadic π-Calculus: a Tutorial , 1993 .

[16]  W. A. Coppel,et al.  Dynamics in One Dimension , 1992 .

[17]  J. V. Tucker.  Computability and the Algebra of Fields: Some Affine Constructions , 1980, J. Symb. Log..

[18]  Wolfgang Wechler,et al.  Universal Algebra for Computer Scientists , 1992, EATCS Monographs on Theoretical Computer Science.

[19]  Tamás Gergely,et al.  First-Order Programming Theories , 1991, EATCS Monographs on Theoretical Computer Science.

[20]  Jr. Hartley Rogers.  Theory of Recursive Functions and Effective Computability , 1969 .

[21]  S. C. Kleene,et al.  Introduction to Metamathematics , 1952 .

[22]  Jan A. Bergstra,et al.  Algebraic Specifications of Computable and Semicomputable Data Types , 1987, Theor. Comput. Sci..

[23]  John V. Tucker,et al.  Theoretical Foundations of VLSI Design , 1991 .

[24]  Rolf Herken,et al.  The Universal Turing Machine: A Half-Century Survey , 1992 .

[25]  D. Barkley.  A model for fast computer simulation of waves in excitable media , 1991 .

[26]  Disturbance propagation in coupled lattice maps , 1989 .

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

[28]  N. Costa,et al.  Undecidability and incompleteness in classical mechanics , 1991 .

[29]  J. V. Tucker,et al.  Program correctness over abstract data types, with error-state semantics , 1988, CWI monographs.

[30]  H. Friedman,et al.  Harvey Friedman's Research on the Foundations of Mathematics , 1985 .

[31]  Michael J. O'Donnell,et al.  Constructivity in Computer Science , 1992, Lecture Notes in Computer Science.

[32]  J. Eckmann,et al.  Iterated maps on the interval as dynamical systems , 1980 .

[33]  K. Kaneko.  Pattern dynamics in spatiotemporal chaos: Pattern selection, diffusion of defect and pattern competition intermettency , 1989 .