Cited by 115Computability, Logic, AI AlgorithmsLogic, programming, and type systemsEvolutionary Algorithms and Applications

Gödel Machines: Fully Self-referential Optimal Universal Self-improvers

Schmidhuber, Jürgen·2007·Cognitive Technologies

Integrity signals

Registry

Crossref · 10.1007/978-3-540-68677-4_7

Cites

71 of 71 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Cites

Flagged first, then by citations

Research works printed but not linked: 5

  1. Levin LA (1973) Universal sequential search problems. Problems of Information Transmission, 9(3):265–266.
  2. Penrose R (1994) Shadows of the mind. Oxford University Press, Oxford.
  3. Schmidhuber J (1987) Evolutionary principles in self-referential learning. Diploma thesis, Institut für Informatik, Technische Universität München.
  4. 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.
  5. Solomonoff R (2003) Progress in incremental machine learning-Preliminary Report for NIPS 2002 Workshop on Universal Learners and Optimal Search

Cited by

Sorted by citations

Authors
Schmidhuber, J.
Affiliations
Dalle Molle Institute for Artificial Intelligence Research (CH)
Corresponding author
Schmidhuber, Jürgen
Venue
Cognitive Technologies
Published
2007
Pages
199-226
ISSN
1611-2482 (ISSN-L)
OpenAlex
W158468099
Cited by
110
References
71
Citations by year
2026: 16 · 2025: 2 · 2024: 1 · 2023: 5 · 2022: 5 · 2021: 6 · 2020: 7 · 2019: 4 · 2018: 8 · 2017: 4 · 2016: 4 · 2015: 5 · 2014: 6 · 2013: 3 · 2012: 9
FWCI
13.91
Type
book chapter
Language
en
Open access
closed
Locations
Cognitive technologies (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
  • Physical Sciences › Computer Science › Artificial Intelligence › Logic, programming, and type systems
  • Physical Sciences › Computer Science › Artificial Intelligence › Evolutionary Algorithms and Applications
Keywords
self-improving systems, proof search, optimal complexity, utility functions, local optima avoidance

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review