Turing Computability with Neural Nets

@inproceedings{Siegelmann1991TuringCW,
  title={Turing Computability with Neural Nets},
  author={Hava T. Siegelmann and Eduardo D. Sontag},
  year={1991}
}
This paper shows the existence of a finite neural network, made up of sigmoidal nenrons, which simulates a nniversal Turing machine. It is composed of less then lo5 synchronously evolving processors, interconnected linearly. High-order connections are not required. 

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Neural nets are universal computing devices, Report SYCON-91-08

H. T. Siegehnann, E. D. Sontag
Rutgers Center for Systems and Control, Rutgers University, • 1991
View 1 Excerpt

Turing equivalence of neural networks with second order connection weights

G. Z. Sun, H.-H. Chen, Y.-C. Lee, C. L. Giles
In Proc. Znt. Joint Conj. Neural Networks, Seattle, • 1991
View 1 Excerpt

Dynamics of iterated-map neural networks.

Physical review. A, General physics • 1989

NP completeness, recursive functions, and universal machines, Bull

L. Blum, M. Shub, S. Smale, On a theory of computation, complexity over the real numbers
A.M.S. 21 (l), l-46 • 1989

Westervelt, Dynamics of iterated-map neural networks

R.M.C.M. Marcus
Phys. Rev. Ser. A • 1989
View 1 Excerpt

Neural nets are universal computing devices

H. T. Siegelmann, E. D. Sontag
1987

Similar Papers

Loading similar papers…