Goedel机：可证明最优自我改进的自参考通用问题求解器
Goedel Machines: Self-Referential Universal Problem Solvers Making Provably Optimal Self-Improvements
摘要：
我们提出了第一类严格的数学，一般的，完全自我参考，自我提高，最佳效率的问题求解器。受库尔特·哥德尔（Kurt Goedel）著名的自指公式（1931年）的启发，这样的问题求解器一旦发现重写有用的证明，就会重写自己代码的任何部分，其中依赖于问题的效用函数和硬件以及整个初始代码由编码在初始证明文件中的公理描述，该初始证明文件也是初始代码的一部分。系统性和有效地测试可计算证明技术（程序的输出是证明），直到它找到一个可证明有用的，可计算的自我重写。我们表明，这样的自我重写是全局最优的-没有局部最大值！- 因为代码首先必须证明继续对备选自重写的证明搜索是没有用的。与以前基于硬连线证明搜索器的非自引用方法不同，我们的方法不仅拥有最佳的复杂度，而且可以最佳地减少O（）符号隐藏的任何减速，只要这种加速的效用是可证明的。
英文摘要：
We present the first class of mathematically rigorous, general, fully self-referential, self-improving, optimally efficient problem solvers. Inspired by Kurt Goedel's celebrated self-referential formulas (1931), such a problem solver rewrites any part of its own code as soon as it has found a proof that the rewrite is useful, where the problem-dependent utility function and the hardware and the entire initial code are described by axioms encoded in an initial proof searcher which is also part of the initial code. The searcher systematically and efficiently tests computable proof techniques (programs whose outputs are proofs) until it finds a provably useful, computable self-rewrite. We show that such a self-rewrite is globally optimal - no local maxima! - since the code first had to prove that it is not useful to continue the proof search for alternative self-rewrites. Unlike previous non-self-referential methods based on hardwired proof searchers, ours not only boasts an optimal order of complexity but can optimally reduce any slowdowns hidden by the O()-notation, provided the utility of such speed-ups is provable at all.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
