%0 Journal Article
%T The Equivalence of the Hopfield Neural Networks and Turing Machine<br>Hopfield网的图灵等价性
%A MENG Xiang wu
%A CHENG Hu
%A <br>孟祥武
%A 程虎
%J 软件学报
%D 1998
%I 
%X 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.
%K Hopfield neural networks
%K Turing machine
%K computability
%K partial recursive function
%K neural networks<br>Hopfield网
%K 图灵机
%K 可计算性
%K 部分递归函数
%K 神经网络
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=E9030F30879E064F480A372949601F8C&yid=8CAA3A429E3EA654&vid=9CF7A0430CBB2DFD&iid=CA4FD0336C81A37A&sid=BE33CC7147FEFCA4&eid=D997634CFE9B6321&journal_id=1000-9825&journal_name=软件学报&referenced_num=1&reference_num=10