The DOI matches its Crossref record; 71 of the 71 references it cites were found in a registry or an index.
Gödel Machines: Fully Self-referential Optimal Universal Self-improvers
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Reinforcement Learning: An Introduction
Sutton, R. S., & Barto, A. G. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.1998.712192 · Cited by 27,225
Reinforcement Learning: An Introduction
Sutton, R. S., & Barto, A. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2004.842673 · Cited by 25,268
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
Advances in Neural Information Processing Systems 14
(2002) · The MIT Press eBooks · doi:10.7551/mitpress/1120.001.0001 · Cited by 9,187
Reinforcement Learning: A Survey
Kaelbling, L. P., Littman, M. L., & Moore, A. W. (1996) · Journal of Artificial Intelligence Research · doi:10.1613/jair.301 · Cited by 8,972
On computable numbers, with an application to the entscheidungsproblem
Turing, A. M. (1937) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s2-42.1.230 · Cited by 8,283
Lecture Notes in Artificial Intelligence
Brézillon, P., & Bouquet, P. (1999) · Cited by 7,436
Some Studies in Machine Learning Using the Game of Checkers
Samuel, A. L. (1959) · IBM Journal of Research and Development · doi:10.1147/rd.33.0210 · Cited by 4,443
�ber den anschaulichen Inhalt der quantentheoretischen Kinematik und Mechanik
Heisenberg, W. (1927) · Zeitschrift f�r Physik · doi:10.1007/bf01397280 · Cited by 4,278
An Introduction to Kolmogorov Complexity and Its Applications
Li, M., & Vitanyi, P. M. B. (2019) · Texts in computer science · doi:10.1007/978-3-030-11298-1 · Cited by 3,769
Research works printed but not linked: 5
- Levin LA (1973) Universal sequential search problems. Problems of Information Transmission, 9(3):265–266.
- Penrose R (1994) Shadows of the mind. Oxford University Press, Oxford.
- Schmidhuber J (1987) Evolutionary principles in self-referential learning. Diploma thesis, Institut für Informatik, Technische Universität München.
- 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 (2003) Progress in incremental machine learning-Preliminary Report for NIPS 2002 Workshop on Universal Learners and Optimal Search
Cited by
Sorted by citations
Deep learning in neural networks: an overview
Schmidhuber, J. (2015) · Neural Networks · doi:10.1016/j.neunet.2014.09.003 · Cited by 18,570
Self-citationFormal theory of creativity, fun, and intrinsic motivation (1990–2010)
Schmidhuber, J. (2010) · IEEE Transactions on Autonomous Mental Development · doi:10.1109/tamd.2010.2056368 · Cited by 747
Self-citationArtificial General Intelligence: Concept, State of the Art, and Future Prospects
Goertzel, B. (2014) · Journal of Artificial General Intelligence · doi:10.2478/jagi-2014-0001 · Cited by 554
Artificial Intelligence as a Positive and Negative Factor in Global Risk
Yudkowsky, E. (2008) · Global Catastrophic Risks · doi:10.1093/oso/9780198570509.003.0021 · Cited by 431
Evolved Policy GradientsPreprint
Houthooft, R., Chen, R. Y., Isola, P., Stadie, B. C., Wolski, F., Ho, J., & Abbeel, P. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1802.04821 · Cited by 168
Metadata
- Authors
- Schmidhuber, J.
- Affiliations
- Dalle Molle Institute for Artificial Intelligence Research (CH)
- Corresponding author
- Schmidhuber, Jürgen
- ORCID
- Schmidhuber, Jürgen
- Venue
- Cognitive Technologies
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007
- Pages
- 199-226
- ISSN
- 1611-2482 (ISSN-L)
- OpenAlex
- W158468099
- Semantic Scholar
- 402a5f749c99c75c98a626539553c2e4b5939c29
- 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
- Licence
- Locations
- Cognitive technologies (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
- Physical Sciences › Computer Science › Software › 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
