Highly Influenced

# Turing Machines Are Recurrent Neural Networks

@inproceedings{Hyotyniemi1996TuringMA, title={Turing Machines Are Recurrent Neural Networks}, author={Heikki Hyotyniemi}, year={1996} }

- Published 1996

Any algebraically computable function can be expressed as a recurrent neural network structure consisting of identical computing elements (or, equivalently, as a nonlinear discrete-time system of the form x(k + 1) = f(Ax(k)), where f() is a simplècut' function). A constructive proof is presented in this paper.

Highly Cited

This paper has 29 citations. REVIEW CITATIONS

#### From This Paper

##### Figures, tables, and topics from this paper.

21 Citations

6 References

Similar Papers