Are Neural Nets Turing Equivalent?

[Guo-Zheng Sun]

Recently, we studied the computability of neural nets and proved sevaral
theorems. Basically, the results are that
(1) Given an arbitrary Turing machine there exists a uniform recurrent
neural net with second-order connection weights which can simulate it.
(2) Therefore, neural nets can simulate universal Turing machines.

The preprint will be available soon.

Guo-Zheng Sun
Institute for Advanced Computer Studies
University of Maryland