The Dynamic Universality of Sigmoidal Neural Networks

Information and Computation

Volumn 128, Issue 1, 1996, Pages 48-56

  Kilian, Joe ^a   Siegelmann, Hava T ^b  

^a NEC LABORATORIES AMERICA   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001713459     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.0062     Document Type: Article

References (13)

1. Cleeremans A., Servan-Schreiber, D., and McClelland, J. (1989), Finite state automata and simple recurrent networks, Neural Computation 1, 372.
2. Elman, J. L. (1990), Finding structure in time, Cognitive Sci. 14, 179.
3. Giles, C. L., Miller, C. B., Chen, D., Chen, H. H., Sun, G. Z., and Lee, Y. C. (1992), Learning and extracting finite state automata with second-order recurrent neural networks, Neural Computation 4, 393-405.
4. Hopcroft, J., and Ullman, J. (1979), "Introduction to Automata Theory, Languages, and Computation," Addison-Wesley, Readings, MA.
5. Koiran, P., Universal neural networks, manuscript.
6. McCulloch, W. S., and Pitts, W. (1943), A logical calculus of the ideas immanent in nervous activity, Bull. Math. Biophys. 5, 115-133.
7. Minsky, M. L. (1967), "Computation: Finite and Infinite Machines," Prentice-Hall, Engelwood Cliffs, NJ.
8. Pollack, J. B. (1987), "On Connectionist Models of Natural Language Processing," Ph.D. Dissertation, Compute Science Dept., Univ. of Illinois, Urbana.
9. Pollack, J. B. (1990), "The Induction of Dynamical Recognizers", Technical Report 90-JP-Automata, Dept. of Computer and Information Science, Ohio State University.
10. Siegelmann, H. T., and Sontag, E. D. (1991), Turing computability with neural networks, Appl. Math. Lett. 4, 6.
11. Siegelmann, H. T., and Sontag, E. D. (1995), On the computational power of neural networks, J. Comput. System Sci. 50, 132-150.
12. Siegelmann, H. T., and Sontag, E. D. (1994), Neural networks analog computation via real weights: Analog computational complexity, Theoret. Comput. Sci. 131, 331-360.
13. Williams, R. J., and Zipser, D. (1989), A learning algorithm for continually running fully recurrent neural networks, Neural Comput. 1, 270.