On the computational power of neural nets

Journal of Computer and System Sciences

Volumn 50, Issue 1, 1995, Pages 132-150

  Siegelmann, Hava T ^a   Sontag, Eduardo D ^b  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; FINITE AUTOMATA; GRAPH THEORY; INTERCONNECTION NETWORKS; REAL TIME SYSTEMS; RECURSIVE FUNCTIONS; SYNCHRONIZATION; TURING MACHINES;

NON DETERMINISTIC RATIONAL NETS; PROCESSOR NETS; RATIONAL VALUED COEFFICIENT; SATURATED LINEAR FUNCTION; SIGMOIDAL FUNCTIONS;

NEURAL NETWORKS;

EID: 0029255891     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1995.1013     Document Type: Article

References (30)

1. N. Alón, A. K. Dewdney, and T. J. Ott, Efficient simulation of finite automata by neural nets, J. Assoc. Comput. Mach. 38, No. 2 (1991), 495-514.
2. R. Batruni, A multilayer neural network with piecewise-linear structure and back-propagation learning, IEEE Trans. Neural Networks 2 (1991), 395-403.
3. J. Berstel and C. Reutenauer, “Rational Series and their Languages, ” Springer-Verlag, Berlin, 1988.
4. L. Blum, M. Shub, and S. Smale, On a theory of computation and complexity over the real numbers: NP completeness, recursive functions, and universal machines, Bull. Amer. Math. Soc. 21 (1989), 1-46.
5. J. R. Brown, M. M. Garber, and S. F. Vanable, Artificial neural network on a SIMD architecture, in “Proceedings, 2nd Symposium on the Frontier of Massively Parallel Computation, Fairfax, 1988, ” pp. 43-47.
6. A. Cleeremans, D. Servan-Schreiber, and J. McClelland, Finite state automata and simple recurrent networks, Neural Comput. 1, No. 3 (1989), 372.
7. J. L. Elman, Finding structure in time. Cog. Sci. 14 (1990), 179-211.
8. S. Franklin and M. Garzón, Neural computability, in “Progress in Neural Networks” (O. M. Omidvar, Ed), pp. 128-144, Ablex, Norwood, NJ, 1990.
9. M. Garzón and S. Franklin, Neural computability, in “Proceedings, 3rd Int. Joint Conf. Neural Networks, 1989, ” Vol. 2, pp. 631-637.
10. C. L. Giles, C. B. Miller, D. Chen, H. H. Chen, G. Z. Sun, and Y. C. Lee, Learning and extracting finite state automata with second-order recurrent neural networks, Neural Comput. 4, No. 3 (1992), 393-405.
11. R. Hartley and H. Szu, A comparison of the computational power of neural network models, in “Proceedings, IEEE Conf. Neural Networks, 1987, ” pp. 17-22.
12. J. J. Hopfteld and D. W. Tank, Neural computation of decisions in optimization problems, Biol. Cybern. 52 (1985), 141-152.
13. J. E. Hopcroft and J. D. Ullman, “Introduction to Automata Theory, Languages, and Computation, ” Addison-Wesley, Reading, MA, 1979.
14. S. C. Kleene, Representation of events in nerve nets and finite automata, in “Automata Studies” (C. E. Shannon and J. McCarthy, Ed.), pp. 3-41, Princeton Univ. Press, Princeton, NJ, 1956.
15. R. P. Lippmann, An introduction to computing with neural nets, IEEE Acoust. Speech Signal Process. Mag. April (1987), 4-22.
16. M. L. Minsky, “Computation: Finite and Infinite Machines, " Prentice Hall, Engelwood ClifTs, NJ 1967.
17. W. Maass, G. Schnitger, and E. D. Sontag, On the computational power of sigmoid versus boolean threshold circuits, in “Proceedings, 32nd Annu. Sympos. On Foundations of Computer Science, 1991, " pp. 767-776.
18. C. M. Marcus and R. M. Westervelt, Dynamics of iterated-map neural networks, Phys. Rev. Ser. A 40 (1989). 3355-3364.
19. M. Pour-El, Abstract computability and its relation to the general purpose analog computer, Trans. Amer. Math Soc. 290 (1974), 1-29.
20. J. B. Pollack, “On Connectionist Models of Natural Language Processing, ” Ph.D. thesis, Computer Science Dept, Univ. Of Illinois, Urbana, 1987.
21. J. H. Reif, J. D. Tygar, and A. Yoshid, The computability and complexity of optical beam tracing, in “Proceedings, 31st Annu. Sympos. On Foundations of Computer Science, 1990, ” pp. 106-144.
22. G. Z. Sun, H. H. Chen, Y. C. Lee, and C. L. Giles, Turing equivalence of neural networks with second-order connection weights, in “Proceedings International Joint Conference on Neural Networks, IEEE, 1991.”
23. C. E. Shannon, A universal turing machine with two internal states, in “Automata Studies” (C. E. Shannon and J. McCarthy, Eds.), pp. 156-165, Princeton Univ. Press, Princeton, NJ, 1956.
24. E. D. Sontag, “Mathematical Control Theory: Deterministic Finite Dimensional Systems, " Springer-Verlag, New York, 1990.
25. E. D. Sontag, Feedforward nets for interpolation and classification, J. Comput. System. Sci. 45 (1992), 20-48.
26. FI. T. Siegelmann and E. D. Sontag, Analog computation via neural networks, Theoret. Comput. Sci. 131 (1994), 331-360.
27. W. Pitts and W. S. McCulloch, A logical calculus of ideas immanent in nervous activity, Bull. Math. Biophys. 5 (1943), 115-133.
28. D. Wolpert, “A Computationally Universal Field Computer Which Is Purely Linear, ” Technical Report LA-UR-91-2937, Los Alamos National Laboratory, 1991.
29. R. J. Williams and D. Zipser, A learning algorithm for continually running fully recurrent neural networks. Neural Comput. 1, No. 2 (1989).
30. B. Zhang, L. Zhang, and H. Zhang, A quantitative analysis of the behavior of the pin network, Neural Networks 5 (1992). 639-661.