###
DOI:
Journal of Software:1998.9(1):43-46

Hopfield网的图灵等价性
孟祥武,程虎
(中国科学院软件研究所,北京,100080; 北京邮电大学计算机工程系,北京,100876)
The Equivalence of the Hopfield Neural Networks and Turing Machine
MENG Xiang wu,CHENG Hu
()
Abstract
Chart / table
Reference
Similar Articles
Article :Browse 2741   Download 2395
Received:November 20, 1996    Revised:April 11, 1997
> 中文摘要: 本文给出了用Hopfield网计算部分递归函数的构造性证明.由于部分递归函数与图灵机等价,故Hopfield网与图灵机等价.
Abstract: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.
文章编号:     中图分类号:    文献标志码:
基金项目:
Foundation items:
Reference text:

孟祥武,程虎.Hopfield网的图灵等价性.软件学报,1998,9(1):43-46

MENG Xiang wu,CHENG Hu.The Equivalence of the Hopfield Neural Networks and Turing Machine.Journal of Software,1998,9(1):43-46