Analog computation via neural networks

The authors pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. The systems have a fixed structure, invariant in time, corresponding to an unchanging number of 'neurons'. If allowed exponential time for computation, they turn out to have unbounded power. However, under polynomial-time constraints there are limits on their capabilities, though being more powerful than Turing machines. These networks are not likely to solve polynomially-NP-hard problems, as the equality 'P=NP' implies the almost complete collapse of the standard polynomial hierarchy. In contrast to classical computational models, the models studied exhibit at least some robustness with respect to noise and implementation errors.<<ETX>>

[1]  José L. Balcázar,et al.  Structural Complexity I , 1995, Texts in Theoretical Computer Science An EATCS Series.

[2]  D. Wolpert,et al.  A Computationally Universal Field Computer That is Purely Linear , 1993 .

[3]  Hava T. Siegelmann,et al.  On the power of sigmoid neural networks , 1993, COLT '93.

[4]  Hava T. Siegelmann,et al.  On the computational power of neural nets , 1992, COLT '92.

[5]  C. Lee Giles,et al.  Learning and Extracting Finite State Automata with Second-Order Recurrent Neural Networks , 1992, Neural Computation.

[6]  B. MacLennan Continuous Symbol Systems: The Logic of Connectionism , 1991 .

[7]  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.

[8]  C. L. Giles,et al.  Second-order recurrent neural networks for grammatical inference , 1991, IJCNN-91-Seattle International Joint Conference on Neural Networks.

[9]  Timothy X. Brown,et al.  Competitive neural architecture for hardware solution to the assignment problem , 1991, Neural Networks.

[10]  Michael Barr,et al.  The Emperor's New Mind , 1989 .

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

[12]  Jia-Wei Hong On connectionist models , 1988 .

[13]  B. Dickinson,et al.  The complexity of analog computation , 1986 .

[14]  Uzi Vishkin,et al.  Constant Depth Reducibility , 1984, SIAM J. Comput..

[15]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[16]  K. Atkinson An introduction to numerical analysis , 1979 .

[17]  John E. Savage,et al.  The Complexity of Computing , 1976 .

[18]  Ann Yasuhara,et al.  Recursive function theory and logic , 1971, Computer science and applied mathematics.

[19]  Saburo Muroga,et al.  Threshold logic and its applications , 1971 .

[20]  David E. Muller,et al.  Complexity in Electronic Switching Circuits , 1956, IRE Trans. Electron. Comput..