Analog Computation via Neural Networks
@article{Siegelmann1994AnalogCV, title={Analog Computation via Neural Networks}, author={H. Siegelmann and Eduardo Sontag}, journal={Theor. Comput. Sci.}, year={1994}, volume={131}, pages={331-360} }
Abstract We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our 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. (A similar but more restricted model… CONTINUE READING
365 Citations
Computational capabilities of recurrent neural networks based on their attractor dynamics
- Computer Science
- 2015 International Joint Conference on Neural Networks (IJCNN)
- 2015
- 9
References
SHOWING 1-10 OF 37 REFERENCES
On a theory of computation and complexity over the real numbers: $NP$- completeness, recursive functions and universal machines
- Mathematics
- 1989
- 1,037
- PDF
Learning and Extracting Finite State Automata with Second-Order Recurrent Neural Networks
- Computer Science
- Neural Computation
- 1992
- 471
Competitive neural architecture for hardware solution to the assignment problem
- Computer Science
- Neural Networks
- 1991
- 71
Complexity in Electronic Switching Circuits
- Mathematics, Computer Science
- IRE Trans. Electron. Comput.
- 1956
- 91