/
LATENT REFERENCES / TAG1

Gödel Machine

This reference note belongs to Tag1 in Latent References, an archive curated by Keigo Yoshida. Its archive region is Film. The note preserves its source text and links so that readers can trace the material behind the 3D map.

Collection
Tag1
Archive region
Film

Archived reference note

English translation of the archived note. JP shows the original text. Source links and literal code are retained; the translation does not update or independently verify the source claims.

AI researchers have long sought AI that continues learning indefinitely. One route is to have AI rewrite its own code (program) to encourage self-improvement. More than 20 years ago, Jürgen Schmidhuber proposed the Gödel Machine, a hypothetical self-improving AI. A Gödel Machine rewrites its own code when it can mathematically prove that a self-modification will lead to improvement, thereby solving problems optimally. This is an important concept in the field of “meta-learning,” in which AI learns how to learn. However, the Gödel Machine remains a theoretical entity, since it rests on the unrealistic assumption that one can “mathematically prove” that a self-modification brings improvement. We therefore devised a more practical approach in collaboration with Professor Jeff Clune's laboratory at the University of British Columbia. Using principles of open-ended algorithms resembling Darwinian evolution, it explores self-modifications leading to better performance on the basis of experience rather than mathematical proof. https://sakana.ai/dgm-jp/

Source updated 2026-02-07 · Snapshot 2026-10-08

Source links and calculated neighbors

Cosine values measure shared lexical features, not truth, agreement or identical meaning. Original reference links are labeled separately.

  • Gödel's Incompleteness TheoremsComputed lexical cosine similarity 0.117 · shared title, text, tags and references
  • YodelComputed lexical cosine similarity 0.110 · shared title, text, tags and references