arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1203.1792cs.CC
收藏

基于信息熵的最小计算复杂性计算

Calculation of the minimum computational complexity based on information entropy

Xue Wu

摘要:

为了确定计算机求解某一特定问题的极限速度,提出了一种基于信息熵的方法。说明了最小计算复杂性与信息熵变化之间的关系。几个例子可以作为这种联系的证据。同时,建立了问题建模的一些基本规则。最后,揭示了用计算机程序求解问题的本质,并提出了信息熵在这一领域的新定义。这将开辟一个新的科学领域。

英文摘要:

In order to find out the limiting speed of solving a specific problem using computer, this essay provides a method based on information entropy. The relationship between the minimum computational complexity and information entropy change is illustrated. A few examples are served as evidence of such connection. Meanwhile some basic rules of modeling problems are established. Finally, the nature of solving problems with computer programs is disclosed to support this theory and a redefinition of information entropy in this filed is proposed. This will develop a new field of science.

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

↑