Answers.Body: <h3><a href="https://arxiv.org/pdf/cs/0309048.pdf" rel="nofollow noreferrer">Gödel machine</a></h3>
  <p>There is another mathematical framework for AGI: <strong>the Gödel machine</strong>, which was proposed by Jürgen Schmidhuber (who also worked with Marcus Hutter). In the paper <a href="https://arxiv.org/pdf/cs/0309048.pdf" rel="nofollow noreferrer">Gödel Machines: Self-Referential Universal Problem Solvers Making Provably Optimal Self-Improvements</a> (2003), Schmidhuber describes the Gödel machine as follows</p>
  <blockquote>
  <p>They are universal problem solving systems that interact with some (partially observable) environment and can in principle modify themselves without essential limits apart from the limits of computability. Their initial algorithm is not hardwired; it can completely rewrite itself, but only if a proof searcher embedded within the initial algorithm can first prove that the rewrite is useful, given a formalized utility function reflecting computation time and expected future success (e.g., rewards). We will see that self-rewrites due to this approach are actually globally optimal (Theorem 4.1, Section 4), relative to Gödel's well-known fundamental restrictions of provability. These restrictions should not worry us; if there is no proof of some self-rewrite's utility, then humans cannot do much either.</p>
  <p>The initial proof searcher is <span class="math-container">$O$</span>()-optimal (has an optimal order of complexity) in the sense of Theorem 5.1, Section 5. Unlike hardwired systems such as Hutter's and Levin's (Section 6.4), however, a Gödel machine can in principle speed up any part of its initial software, including its proof searcher, to meet arbitrary formalizable notions of optimality beyond those expressible in the <span class="math-container">$O$</span>()-notation. Our approach yields the first theoretically sound, fully self-referential, optimal, general problem solvers.</p>
  </blockquote>
  <h3><a href="https://hal.inrae.fr/hal-02745675/document" rel="nofollow noreferrer">Space-time embedded agents</a></h3>
  <p>This work combines <a href="https://www.jair.org/index.php/jair/article/view/10134" rel="nofollow noreferrer">Russell's <strong>bounded rationality</strong></a> with <a href="https://doc.rero.ch/record/9503/files/2008INFO002.pdf" rel="nofollow noreferrer">Legg's and Hutter's definition of <strong>universal intelligence</strong></a> to provide a framework for AGI that takes into account resource (space and time) constraints and other issues (such as that the environment can modify or even destroy the agent).</p>
  
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2020-05-23T14:39:13.500Z
Answers.LastActivityDate: 2021-01-17T16:04:37.560Z
Answers.LastEditDate: 2021-01-17T16:04:37.560Z
Answers.UserDisplayName: nbro
Body: <p>AIXI is a mathematical framework for artificial <strong>general</strong> intelligence developed by Marcus Hutter since the year 2000. It's based on many concepts, such as reinforcement learning, Bayesian statistics, Occam's razor, or Solomonoff induction. The blog post <a href="https://jan.leike.name/AIXI.html" rel="nofollow noreferrer">What is AIXI? — An Introduction to General Reinforcement Learning</a> provides an accessible overview of the topic for those of you not familiar with it.</p>
  
  <p>Are there any other <strong>mathematical</strong> frameworks of artificial <strong>general</strong> intelligence apart from AIXI? </p>
  
  <p>I am aware of projects such as <a href="https://wiki.opencog.org/w/The_Open_Cognition_Project" rel="nofollow noreferrer">OpenCog</a>, but that's not really a mathematical framework, but more a cognitive science framework.</p>
  
Tags: <reference-request><agi><aixi><godel-machine>
Title: Are there other mathematical frameworks of artificial general intelligence apart from AIXI?
UserDisplayName: nbro
ThreadText: # Are there other mathematical frameworks of artificial general intelligence apart from AIXI?
  
  (Asked by: username_0 on 2020-05-23)
  
  AIXI is a mathematical framework for artificial **general** intelligence developed by Marcus Hutter since the year 2000. It's based on many concepts, such as reinforcement learning, Bayesian statistics, Occam's razor, or Solomonoff induction. The blog post [What is AIXI? — An Introduction to General Reinforcement Learning](https://jan.leike.name/AIXI.html) provides an accessible overview of the topic for those of you not familiar with it.
  
  Are there any other **mathematical** frameworks of artificial **general** intelligence apart from AIXI?
  
  I am aware of projects such as [OpenCog](https://wiki.opencog.org/w/The_Open_Cognition_Project), but that's not really a mathematical framework, but more a cognitive science framework.
  
  **Tags:** reference-request, agi, aixi, godel-machine
  
  
  ---
  
  ## 1 answers
  
  ### Answer by username_0 on 2020-05-23. Score: 1 | Accepted answer
  
  ### [Gödel machine](https://arxiv.org/pdf/cs/0309048.pdf)
  
  There is another mathematical framework for AGI: **the Gödel machine**, which was proposed by Jürgen Schmidhuber (who also worked with Marcus Hutter). In the paper [Gödel Machines: Self-Referential Universal Problem Solvers Making Provably Optimal Self-Improvements](https://arxiv.org/pdf/cs/0309048.pdf) (2003), Schmidhuber describes the Gödel machine as follows
  
  > They are universal problem solving systems that interact with some (partially observable) environment and can in principle modify themselves without essential limits apart from the limits of computability. Their initial algorithm is not hardwired; it can completely rewrite itself, but only if a proof searcher embedded within the initial algorithm can first prove that the rewrite is useful, given a formalized utility function reflecting computation time and expected future success (e.g., rewards). We will see that self-rewrites due to this approach are actually globally optimal (Theorem 4.1, Section 4), relative to Gödel's well-known fundamental restrictions of provability. These restrictions should not worry us; if there is no proof of some self-rewrite's utility, then humans cannot do much either.
  >
  > The initial proof searcher is $O$()-optimal (has an optimal order of complexity) in the sense of Theorem 5.1, Section 5. Unlike hardwired systems such as Hutter's and Levin's (Section 6.4), however, a Gödel machine can in principle speed up any part of its initial software, including its proof searcher, to meet arbitrary formalizable notions of optimality beyond those expressible in the $O$()-notation. Our approach yields the first theoretically sound, fully self-referential, optimal, general problem solvers.
  
  ### [Space-time embedded agents](https://hal.inrae.fr/hal-02745675/document)
  
  This work combines [Russell's **bounded rationality**](https://www.jair.org/index.php/jair/article/view/10134) with [Legg's and Hutter's definition of **universal intelligence**](https://doc.rero.ch/record/9503/files/2008INFO002.pdf) to provide a framework for AGI that takes into account resource (space and time) constraints and other issues (such as that the environment can modify or even destroy the agent).
  
  
  ---
  
  