摘要
本文给出了用Ｈｏｐｆｉｅｌｄ网计算部分递归函数的构造性证明．由于部分递归函数与图灵机等价，故Ｈｏｐｆｉｅｌｄ网与图灵机等价．
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.
出处
《软件学报》
EI
CSCD
北大核心
1998年第1期43-46,共4页
Journal of Software
关键词
HOPFIELD网
图灵机
神经网络
图灵等价性
Hopfield neural networks, Turing machine, computability, partial recursive function, neural networks. Class number\ TP18
