Summary
We present the first class of mathematically rigorous, general, fully self-referential, self-improving, optimally efficient problem solvers. Inspired by Kurt Gödel’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.
Certain parts of this work appear in [46] and [47], both by Springer.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Banzhaf W, Nordin P, Keller RE, Francone FD (1998) Genetic Programming — An Introduction. Morgan Kaufmann Publishers, San Francisco, CA.
Bellman R (1961) Adaptive Control Processes. Princeton University Press, Princeton, NJ.
Blum M (1967) A machine-independent theory of the complexity of recursive functions. Journal of the ACM, 14(2):322–336.
Blum M On effective procedures for speeding up algorithms. Journal of the ACM, 18(2):290–305.
Cantor G Über eine Eigenschaft des Inbegriffes aller reellen algebraischen Zahlen. Crelle’s Journal für Mathematik, 77:258–263.
Chaitin GJ (1975) A theory of program size formally identical to information theory. Journal of the ACM, 22:329–340.
Clocksin WF, Mellish CS (1987) Programming in Prolog. Springer, Berlin, 3rd edition.
Cramer NL (1985) A representation for the adaptive generation of simple sequential programs. In Grefenstette JJ (ed) Proceedings of an International Conference on Genetic Algorithms and Their Applications, Carnegie-Mellon University, July 24–26, 1985, Lawrence Erlbaum, Hillsdale, NJ.
Crick F, Koch C (1998) Consciousness and neuroscience. Cerebral Cortex, 8:97–107.
Fitting MC (1996) First-Order Logic and Automated Theorem Proving. Graduate Texts in Computer Science. Springer, Berlin, 2nd edition.
Gödel K (1931) Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I. Monatshefte für Mathematik und Physik, 38:173–198.
Heisenberg W (1925) Über den anschaulichen Inhalt der quantentheoretischen Kinematik und Mechanik. Zeitschrift für Physik, 33:879–893.
Hochreiter S, Younger AS, Conwell PR (2001) Learning to learn using gradient descent. In Proc. Intl. Conf. on Artificial Neural Networks (ICANN-2001), volume 2130 of LLCS Springer, Berlin, Heidelberg.
Hofstadter D (1979) Gödel, Escher, Bach: an Eternal Golden Braid. Basic Books, New York.
Holland JH (1975) Properties of the bucket brigade. In Proceedings of an International Conference on Genetic Algorithms. Lawrence Erlbaum, Hillsdale, NJ.
Hutter M (2001) Towards a universal theory of artificial intelligence based on algorithmic probability and sequential decisions. Proceedings of the 12 th European Conference on Machine Learning (ECML-2001).
Hutter M (2002) The fastest and shortest algorithm for all well-defined problems. International Journal of Foundations of Computer Science, 13(3):431–443.
Hutter M (2002) Self-optimizing and Pareto-optimal policies in general environments based on Bayes-mixtures. In Proc. 15th Annual Conf. on Computational Learning Theory (COLT 2002), volume 2375 of LNAI, Springer, Berlin.
Kaelbling LP, Littman ML, Moore AW Reinforcement learning: a survey. Journal of AI research, 4:237–285.
Kolmogorov AN (1933) Grundbegriffe der Wahrscheinlichkeitsrechnung. Springer, Berlin, 1933.
Kolmogorov AN (1965) Three approaches to the quantitative definition of information. Problems of Information Transmission, 1:1–11.
Lenat D (1983) Theory formation by heuristic search. Machine Learning, 21.
Levin LA (1973) Universal sequential search problems. Problems of Information Transmission, 9(3):265–266.
Levin LA (1974) Laws of information (nongrowth) and aspects of the foundation of probability theory. Problems of Information Transmission, 10(3):206–210.
Levin LA (1984) Randomness conservation inequalities: Information and independence in mathematical theories. Information and Control, 61:15–37.
Li M, Vitányi PMB (1997) An Introduction to Kolmogorov Complexity and its Applications. Springer, Berlin, 2nd edition.
Löwenheim L (1915) Über Möglichkeiten im Relativkalkül. Mathematische Annalen, 76:447–470.
Moore CH, Leach GC (1970) FORTH-a language for interactive computing, 1970. http://www.ultratechnology.com.
Penrose R (1994) Shadows of the mind. Oxford University Press, Oxford.
Popper KR (1999) All Life Is Problem Solving. Routledge, London.
Samuel AL (1959) Some studies in machine learning using the game of checkers. IBM Journal on Research and Development, 3:210–229.
Schmidhuber J (1987) Evolutionary principles in self-referential learning. Diploma thesis, Institut für Informatik, Technische Universität München.
Schmidhuber J (1991) Reinforcement learning in Markovian and non-Markovian environments. In Lippman DS, Moody JE, Touretzky DS (eds) Advances in Neural Information Processing Systems 3, Morgan Kaufmann, Los Altos, CA.
Schmidhuber J A self-referential weight matrix. In Proceedings of the International Conference on Artificial Neural Networks, Amsterdam, Springer, Berlin.
Schmidhuber J (1994) On learning how to learn learning strategies. Technical Report FKI-198-94, Fakultät für Informatik, Technische Universität München, 1994. See [50, 48].
Schmidhuber J (1995) Discovering solutions with low Kolmogorov complexity and high generalization capability. In Prieditis A and Russell S (eds) Machine Learning: Proceedings of the Twelfth International Conference. Morgan Kaufmann, San Francisco, CA.
Schmidhuber J (1997) A computer scientist’s view of life, the universe, and everything. In Freksa C, Jantzen M, Valk R (eds) Foundations of Computer Science: Potential-Theory-Cognition, volume 1337 of LLNCS, Springer, Berlin.
Schmidhuber J (1997) Discovering neural nets with low Kolmogorov complexity and high generalization capability. Neural Networks, 10(5):857–873.
Schmidhuber J (2000) Algorithmic theories of everything. Technical Report IDSIA-20-00, quant-ph/0011122, IDSIA. Sections 1–5: see [40]; Section 6: see [41].
Schmidhuber J (2002) Hierarchies of generalized Kolmogorov complexities and nonenumerable universal measures computable in the limit. International Journal of Foundations of Computer Science, 13(4):587–612.
Schmidhuber J (2002) The Speed Prior: a new simplicity measure yielding near-optimal computable predictions. In Kivinen J, Sloan RH (eds) Proceedings of the 15th Annual Conference on Computational Learning Theory (COLT 2002), Lecture Notes in Artificial Intelligence, Springer, Berlin.
Schmidhuber J (2003) Bias-optimal incremental problem solving. In Becker S, Thrun S, Obermayer K (eds) Advances in Neural Information Processing Systems 15, MIT Press, Cambridge, MA.
Schmidhuber J (2003) Gödel machines: self-referential universal problem solvers making provably optimal self-improvements. Technical Report IDSIA-19-03, arXiv:cs.LO/0309048 v2, IDSIA.
J. Schmidhuber. The new AI: General & sound & relevant for physics. In this volume.
Schmidhuber J (2004) Optimal ordered problem solver. Machine Learning, 54:211–254.
Schmidhuber J (2005) Gödel machines: Towards a Technical Justification of Consciousness. In Kudenko D, Kazakov D, Alonso E (eds) Adaptive Agents and Multi-Agent Systems III, LNCS 3394, Springer, Berlin.
Schmidhuber J (2005) Completely Self-Referential Optimal Reinforcement Learners. In Duch W et al (eds) Proc. Intl. Conf. on Artificial Neural Networks ICANN’05, LNCS 3697, Springer, Berlin, Heidelberg.
Schmidhuber J, Zhao J, Schraudolph N (1997) Reinforcement learning with self-modifying policies. In Thrun S, Pratt L (eds) Learning to learn, Kluwer, Norwell, MA.
Schmidhuber J, Zhao J, Wiering M (1996) Simple principles of metalearning. Technical Report IDSIA-69-96, IDSIA. See [50, 48].
Schmidhuber J, Zhao J, Wiering M (1997) Shifting inductive bias with success-story algorithm, adaptive Levin search, and incremental self-improvement. Machine Learning, 28:105–130.
Skolem T (1919) Logisch-kombinatorische Untersuchungen über Erfüllbarkeit oder Beweisbarkeit mathematischer Sätze nebst einem Theorem über dichte Mengen. Skrifter utgit av Videnskapsselskapet in Kristiania, I, Mat.-Nat. Kl., N4:1–36.
Solomonoff R (1964) A formal theory of inductive inference. Part I. Information and Control, 7:1–22.
Solomonoff R (1978) Complexity-based induction systems. IEEE Transactions on Information Theory, IT-24(5):422–432.
Solomonoff R (2003) Progress in incremental machine learning—Preliminary Report for NIPS 2002 Workshop on Universal Learners and Optimal Search; revised Sept 2003. Technical Report IDSIA-16-03, IDSIA.
Sutton R, Barto A (1998) Reinforcement Learning: An Introduction. MIT Press, Cambridge, MA.
Turing A (1936) On computable numbers, with an application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, Series 2, 41:230–267.
Wolpert DH, Macready DG (1997) No free lunch theorems for search. IEEE Transactions on Evolutionary Computation, 1.
Zuse K (1969) Rechnender Raum. Friedrich Vieweg & Sohn, Braunschweig. English translation: Calculating Space, MIT Technical Translation AZT-70-164-GEMIT, MIT (Proj. MAC), Cambridge, MA.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Schmidhuber, J. (2007). Gödel Machines: Fully Self-referential Optimal Universal Self-improvers. In: Goertzel, B., Pennachin, C. (eds) Artificial General Intelligence. Cognitive Technologies. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-68677-4_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-68677-4_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23733-4
Online ISBN: 978-3-540-68677-4
eBook Packages: Computer ScienceComputer Science (R0)