Turing universality of neural nets (revisited)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1333, Issue , 1997, Pages 361-366

  Neto, J Pedro ^a   Siegelmann, Hava T ^b   Costa, J Félix ^a   Araujo, C P Suárez ^c  

^a UNIVERSITY OF LISBON   (Portugal)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c UNIVERSITY OF LAS PALMAS DE GRAN CANARIA   (Spain)

Author keywords

Modularity; Neural computation; Recursive function theory

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATION THEORY; MODULAR CONSTRUCTION; NEURAL NETWORKS; PIECEWISE LINEAR TECHNIQUES; SOFTWARE ENGINEERING; SYSTEM THEORY;

ACTIVATION FUNCTIONS; MODULARITY; NETS-WITHIN-NETS; NEURAL COMPUTATIONS; PIECEWISE LINEAR; RECURSIVE FUNCTION THEORY; SIGMOID FUNCTION; TURING UNIVERSALITY;

RECURSIVE FUNCTIONS;

EID: 84876629379     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0025058     Document Type: Conference Paper

References (3)

1. BOOLOS, G. and JEFFREY, R., Computability and Logic, (2° Ed), Cambridge University Press, 1980.
2. H. SIEGELMANN and E. SONTAG, "Neural Nets are Universal Computing Devices". SYCON Report 91-08, Rutgers University, 1991.
3. H. SIEGELMANN and E. SONTAG, "On the Computational Power of Neural Nets", in Journal of Computer and System Science [50] 1, Academic Press, 1995.