arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1009.0884cs.CC
收藏

知识识别算法使P = NP

Knowledge Recognition Algorithm enables P = NP

Han Xiao Wen

摘要:

介绍了一种知识识别算法(KRA),它既是一种图灵机算法,又是一种Oracle图灵机算法。根据定义,KRA是一种非确定性语言识别算法。同时,它可以实现为一个确定性的图灵机算法。KRA应用镜像的感知-概念语言来迭代地学习两种语言之间的成员-类关系,并通过从一种语言到另一种语言的演绎和还原识别来检索信息。KRA的创新之处在于调整了传统的关系概念。因此,计算成为有效的双向字符串映射。

英文摘要:

This paper introduces a knowledge recognition algorithm (KRA) that is both a Turing machine algorithm and an Oracle Turing machine algorithm. By definition KRA is a non-deterministic language recognition algorithm. Simultaneously it can be implemented as a deterministic Turing machine algorithm. KRA applies mirrored perceptual-conceptual languages to learn member-class relations between the two languages iteratively and retrieve information through deductive and reductive recognition from one language to another. The novelty of KRA is that the conventional concept of relation is adjusted. The computation therefore becomes efficient bidirectional string mapping.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑