The Equivalence of the Hopfield Neural Networks and Turing Machine
Hopfield网的图灵等价性

In this paper, the partial recursive function is constructed by Hopfield neural networks. The partial recursive function is equivalent with Turing machine, the computability of Hopfield neural networks is therefore equivalent with Turing machine.