A family of universal recurrent networks

Theoretical Computer Science

Volumn 168, Issue 2, 1996, Pages 473-480

  Koiran, Pascal ^a  

^a UNIV LYON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; FINITE AUTOMATA; FUNCTIONS; THEOREM PROVING;

LINEAR BOUNDED SIGMOID FUNCTION; RECURRENT NEURAL NETWORKS;

NEURAL NETWORKS;

EID: 0030284189     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00088-6     Document Type: Article

References (6)

1. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages and Computation (Addison-Wesley, Reading, MA, 1979).
2. J. Killian and H.T. Siegelmann, On the power of sigmoid neural networks, in: Proc. 6th ACM Workshop on Computational Learning Theory, 1993.
3. P. Koiran, Puissance de calcul des réseaux de neurones artificiels, Ph.D. Thesis, Ecole Normale Supérieure de Lyon, June 1993.
4. H.T. Siegelmann and E.D. Sontag, Turing computation with neural nets, Appl. Math. Lett. 4 (1991) 77-80.
5. H.T. Siegelmann and E.D. Sontag, Analog computation via neural networks, Theoret. Comput. Sci. 131 (1994) 331-360.
6. H.T. Siegelmann and E.D. Sontag, On the computational power of neural nets, J. Comput. System Sci. 50 (1995) 132-150.