arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1702.03152cs.CCcs.DS
收藏

求解所有良定问题的Levin搜索法的一种变型

A Variation of Levin Search for All Well-Defined Problems

Fouad B. Chedid

摘要:

1973年,洛杉矶莱文发表了一个算法,它可以像最快的算法$p^*$一样快速地解决任何反演问题$π$,该算法在由$2^{l(p^*)}.t^*$限定的时间内计算$π$的解,其中$l(p^*)$是$p^*$的二进制编码的长度,$t^*$是$p^*$的运行时间加上验证其正确性的时间。2002年,M. Hutter公布了一种算法,该算法与在由$5.t_{p}(x)+d_p.time_{t_{p}}(x)+c_p$限定的时间内计算$π$的解的最快算法$p^*$一样快地解决任何明确定义的问题$π$,其中$d_p=40.2^{l(p)+l(t_{p})}$和$c_p=40.2^{l(f)+1}.O(l(f)^2)$,其中$l(f)$是产生一对$(p,t_p)$的证明$f$的二进制编码的长度,其中,$t_p(x)$是可证明等价于$p^*$的最快程序$p$的运行时上的可证明时间界限。在本文中,我们重写莱文搜索使用哈特的想法,使我们有一个新的简单的算法,解决任何定义明确的问题$π$一样快,最快的算法$p^*$计算的解决方案$π$在时间有界的$O(l(f)^2).t_p(x)$。

英文摘要:

In 1973, L.A. Levin published an algorithm that solves any inversion problem $π$ as quickly as the fastest algorithm $p^*$ computing a solution for $π$ in time bounded by $2^{l(p^*)}.t^*$, where $l(p^*)$ is the length of the binary encoding of $p^*$, and $t^*$ is the runtime of $p^*$ plus the time to verify its correctness. In 2002, M. Hutter published an algorithm that solves any well-defined problem $π$ as quickly as the fastest algorithm $p^*$ computing a solution for $π$ in time bounded by $5.t_{p}(x)+d_p.time_{t_{p}}(x)+c_p$, where $d_p=40.2^{l(p)+l(t_{p})}$ and $c_p=40.2^{l(f)+1}.O(l(f)^2)$, where $l(f)$ is the length of the binary encoding of a proof $f$ that produces a pair $(p,t_p)$, where $t_p(x)$ is a provable time bound on the runtime of the fastest program $p$ provably equivalent to $p^*$. In this paper, we rewrite Levin Search using the ideas of Hutter so that we have a new simple algorithm that solves any well-defined problem $π$ as quickly as the fastest algorithm $p^*$ computing a solution for $π$ in time bounded by $O(l(f)^2).t_p(x)$.

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

↑