Turing computability with neural nets

[1]  Georg Schnitger,et al.  On the computational power of sigmoid versus Boolean threshold circuits , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[2]  Y. C. Lee,et al.  Turing equivalence of neural networks with second order connection weights , 1991, IJCNN-91-Seattle International Joint Conference on Neural Networks.

[3]  Noga Alon,et al.  Efficient simulation of finite automata by neural nets , 1991, JACM.

[4]  Omid M. Omidvar.  Progress in neural networks , 1991 .

[5]  Hava T. Siegelmann,et al.  Neural nets are universal computing devices , 1991 .

[6]  Eduardo D. Sontag,et al.  Remarks on Interpolation and Recognition Using Neural Nets , 1990, NIPS.

[7]  Eduardo D. Sontag,et al.  Mathematical Control Theory: Deterministic Finite Dimensional Systems , 1990 .

[8]  Westervelt,et al.  Dynamics of iterated-map neural networks. , 1989, Physical review. A, General physics.

[9]  S. Smale,et al.  On a theory of computation and complexity over the real numbers; np-completeness , 1989 .

[10]  Jean Berstel,et al.  Rational series and their languages , 1988, EATCS monographs on theoretical computer science.