Goedel Machines: Self-Referential Universal Problem Solvers Making Provably Optimal Self-Improvements

Details Goedel Machines: Self-Referential Universal Problem Solvers Making Provably Optimal Self-Improvements Goedel Machines: Self-Referential Universal Problem Solvers Making Provably Optimal Self-Improvements

2003-09-25

arxiv.org/abs/cs/0309048v5

Variants published in "Adaptive Agents and Multi-Agent Systems II", LNCS 3394, p. 1-23, Springer, 2005: ISBN 978-3-540-25260-3

Computer Science

Logic in Computer Science

29 pages, 1 figure, minor improvements, updated references

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Goedel Machines: Self-Referential Universal Problem Solvers Making Provably Optimal Self-Improvements does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Goedel Machines: Self-Referential Universal Problem Solvers Making Provably Optimal Self-Improvements, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Goedel Machines: Self-Referential Universal Problem Solvers Making Provably Optimal Self-Improvements will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-55898