所有良定问题的最快最短算法
The Fastest and Shortest Algorithm for All Well-Defined Problems
摘要:
描述了一种算法$M$,其与计算$p$的解的最快算法一样快地解决任何明确定义的问题$p$,除了因子5和低阶加法项。$M$在可证明正确的$p$求解程序的执行和所有证明的枚举之间优化地分配资源,包括程序正确性和程序运行时的时间界限的相关证明。$M$通过忽略没有正确性证明的程序来避免Blum的加速定理。$M$具有更广泛的适用性,并且可以比Levin的通用搜索更快,Levin的通用搜索是除了大的乘法常数之外求逆函数的最快方法。Kolmogorov复杂性的一个扩展和两个新的自然措施的功能复杂性表明,最有效的程序计算某些功能$f$也是最短的程序可证明计算$f$。
英文摘要:
An algorithm $M$ is described that solves any well-defined problem $p$ as quickly as the fastest algorithm computing a solution to $p$, save for a factor of 5 and low-order additive terms. $M$ optimally distributes resources between the execution of provably correct $p$-solving programs and an enumeration of all proofs, including relevant proofs of program correctness and of time bounds on program runtimes. $M$ avoids Blum's speed-up theorem by ignoring programs without correctness proof. $M$ has broader applicability and can be faster than Levin's universal search, the fastest method for inverting functions save for a large multiplicative constant. An extension of Kolmogorov complexity and two novel natural measures of function complexity are used to show that the most efficient program computing some function $f$ is also among the shortest programs provably computing $f$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。