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 条
[11]   COMPUTABILITY WITH LOW-DIMENSIONAL DYNAMICAL-SYSTEMS [J].
KOIRAN, P ;
COSNARD, M ;
GARZON, M .
THEORETICAL COMPUTER SCIENCE, 1994, 132 (1-2) :113-128
[12]  
McCulloch Warren S., 1943, BULL MATH BIOPHYS, V5, P115, DOI 10.1007/BF02478259
[13]   GENERALIZED SHIFTS - UNPREDICTABILITY AND UNDECIDABILITY IN DYNAMIC-SYSTEMS [J].
MOORE, C .
NONLINEARITY, 1991, 4 (02) :199-230
[14]   UNPREDICTABILITY AND UNDECIDABILITY IN DYNAMIC-SYSTEMS [J].
MOORE, C .
PHYSICAL REVIEW LETTERS, 1990, 64 (20) :2354-2357
[15]  
SHANNON CE, 1956, AUTOMATA STUDIES, P156
[16]   ANALOG COMPUTATION VIA NEURAL NETWORKS [J].
SIEGELMANN, HT ;
SONTAG, ED .
THEORETICAL COMPUTER SCIENCE, 1994, 131 (02) :331-360
[17]   TURING COMPUTABILITY WITH NEURAL NETS [J].
SIEGELMANN, HT ;
SONTAG, ED .
APPLIED MATHEMATICS LETTERS, 1991, 4 (06) :77-80
[18]  
SIEGELMANN HT, 1994, 94NN1 TECHN REP
[19]  
SIEGELMANN HT, 1994, LECTURE NOTES COMPUT, V820
[20]  
SIEGELMANN HT, 1992, 5TH P ACM WORKSH COM