COMPUTATION BEYOND THE TURING LIMIT

被引:166
作者
SIEGELMANN, HT
机构
[1] Department of Information Systems Engineering, Faculty of Industrial Engineering, Technion
关键词
D O I
10.1126/science.268.5210.545
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
Extensive efforts have been made to prove the Church-Turing thesis, which suggests that all realizable dynamical and physical systems cannot be more powerful than classical models of computation. A simply described but highly chaotic dynamical system called the analog shift map is presented here, which has computational power beyond the Turing limit (super-Turing); it computes exactly like neural networks and analog machines. This dynamical system is conjectured to describe natural physical phenomena.
引用
收藏
页码:545 / 548
页数:4
相关论文
共 23 条
[1]  
[Anonymous], 1991, INTRO THEORY NEURAL, DOI DOI 10.1201/9780429499661
[2]  
ARNOLD VI, 1986, ERGODIC PROBLEMS CLA
[3]  
BALCAZAR JL, 1988, SPRINGERVERLAG EATCS, V2
[4]  
BALCAZAR JL, 1993, MAY P IEEE STRUCT CO, P253
[5]  
BALCAZAR JL, 1988, SPRINGERVERLAG EATCS, V1
[6]   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
[7]  
DEVANEY RL, 1989, P S APPL MATH, P1
[8]  
Guckenheimer J., 1983, NONLINEAR OSCILLATIO
[9]   OPTICAL REALIZATION OF THE BAKERS TRANSFORMATION [J].
HANNAY, JH ;
KEATING, JP ;
DEALMEIDA, AMO .
NONLINEARITY, 1994, 7 (05) :1327-1342
[10]  
Hopcroft J. E., 1979, INTRO AUTOMATA THEOR