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

关于最短程序的运行时间

On the Running Time of the Shortest Programs

Norbert Bátfai

摘要:

字w的柯尔莫哥洛夫复杂度等于程序Z与其输入x的最短级联的长度,通用图灵机U利用该最短级联计算字w。本文介绍的问题是:最短的程序运行多长时间?

英文摘要:

The Kolmogorov complexity of the word w is equal to the length of the shortest concatenation of program Z and its input x with which the word w is computed by the universal turing machine U. The question introduced in this paper is the following: How long do the shortest programs run for?

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

↑