Universal Problem Solvers Making Self-Improvements: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 14:2814:28, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,796 bytes +1,796‎ Created page with "Title: Universal Problem Solvers Making Self-Improvements Research Question: Can self-referential problem solvers be designed to solve arbitrary computation problems, such as maximizing a robot's future reward in a reactive environment, by making provably optimal self-improvements? Methodology: The researchers propose a self-referential problem solver called a Gödel machine. This machine is designed to solve problems by rewriting its own software as soon as it finds a..."
Retrieved from "https://simplesci.org/wiki/Universal_Problem_Solvers_Making_Self-Improvements"