Coupled map lattices as computational systems

被引:31
作者
Holden, A. V. [1 ]
Tucker, J. V. [2 ]
Zhang, H. [1 ]
Poole, M. J. [2 ]
机构
[1] Univ Leeds, Dept Physiol, Leeds LS2 9JT, W Yorkshire, England
[2] Univ Coll Swansea, Dept Math & Comp Sci, Swansea SA2 8PP, W Glam, Wales
关键词
D O I
10.1063/1.165879
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
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.
引用
收藏
页码:367 / 376
页数:10
相关论文
共 49 条
[1]  
Aberth O., 1980, COMPUTABLE ANAL
[2]   STABILITY OF SPATIALLY HOMOGENEOUS CHAOTIC REGIMES IN UNIDIRECTIONAL CHAINS [J].
ARANSON, IS ;
AFRAIMOVICH, VS ;
RABINOVICH, MI .
NONLINEARITY, 1990, 3 (03) :639-651
[3]   A MODEL FOR FAST COMPUTER-SIMULATION OF WAVES IN EXCITABLE MEDIA [J].
BARKLEY, D .
PHYSICA D, 1991, 49 (1-2) :61-70
[4]  
BEARDON AF, 1991, ITERATION RATIONAL F
[5]  
Bennett C., 1988, UNIVERSAL TURING MAC, P227
[6]   ALGEBRAIC SPECIFICATIONS OF COMPUTABLE AND SEMICOMPUTABLE DATA-TYPES [J].
BERGSTRA, JA ;
TUCKER, JV .
THEORETICAL COMPUTER SCIENCE, 1987, 50 (02) :137-181
[7]  
BLOCK LS, 1992, LECT NOTES MATH, V1513
[8]   ON A THEORY OF COMPUTATION AND COMPLEXITY OVER THE REAL NUMBERS - NP-COMPLETENESS, RECURSIVE FUNCTIONS AND UNIVERSAL MACHINES [J].
BLUM, L ;
SHUB, M ;
SMALE, S .
BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1989, 21 (01) :1-46
[9]   DISTURBANCE PROPAGATION IN COUPLED LATTICE MAPS [J].
BRINDLEY, J ;
EVERSON, RM .
PHYSICS LETTERS A, 1989, 134 (04) :229-236
[10]   SPATIO-TEMPORAL INTERMITTENCY IN COUPLED MAP LATTICES [J].
CHATE, H ;
MANNEVILLE, P .
PHYSICA D, 1988, 32 (03) :409-422