TURING COMPUTABILITY WITH NEURAL NETS

被引：210

作者：

SIEGELMANN, HT

SONTAG, ED

机构：

[1] RUTGERS STATE UNIV,DEPT COMP SCI,NEW BRUNSWICK,NJ 08903

[2] RUTGERS STATE UNIV,DEPT MATH,NEW BRUNSWICK,NJ 08903

来源：

APPLIED MATHEMATICS LETTERS | 1991年 / 4卷 / 06期

关键词：

D O I：

10.1016/0893-9659(91)90080-F

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

This paper shows the existence of a finite neural network, made up of sigmoidal neurons, which simulates a universal Turing machine. It is composed of less than 10(5) synchronously evolving processors, interconnected linearly. High-order connections are not required.

引用

页码：77 / 80

页数：4

共 11 条

[1]

ALON N, IN PRESS JACM

[2]

BERSTEL J, 1988, RATIONAL SYSTEMS THE

[3] 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

[4]

Franklin S. P., 1990, PROGR NEURAL NETWORK, V1, P128

[5]

MAASS W, 1991, 32ND P ANN S F COMP

[6]

MARCUS CM, 1989, PHYS REV A, V40, P3355

[7]

POLLACK JB, 1987, THESIS U ILLINOIS UR

[8]

SIEGELMANN HT, 1991, SYCON9108 RUTG U RUT

[9]

Sontag E.D., 1990, MATH CONTROL THEORY

[10]

SONTAG ED, 1991, ADV NEURAL INFORMATI, V3, P939

← 1 2 →