A Computability Argument Against Superintelligence
The DOI matches its Crossref record; 35 of the 36 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“As established in Section 3.5.1, logarithmic growth limits [80] and computability ceilings [77] dictate that an introspective self-improver inevitably forfeits global optimality, approaching it only asymptotically as T→∞.”
From Self-Referential Introspection in Large Language Models: The Critical Threshold for Recursive Self-Improvement (2026) · cites this paper as [77]
In the citing paper
“Rice’s theorem dictates that no general algorithm can decide whether an arbitrary program modification constitutes an improvement [77]”
From Self-Referential Introspection in Large Language Models: The Critical Threshold for Recursive Self-Improvement (2026) · cites this paper as [77]
Citations
Cites
Introduction to automata theory, languages and computation
(1981) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(81)90068-9 · Cited by 10,699
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
Introduction to automata theory, languages, and computation
(1980) · Computer Languages · doi:10.1016/0096-0551(80)90011-9 · Cited by 6,824
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Cognition, evolution, and behavior
(2010) · Choice Reviews Online · doi:10.5860/choice.47-5652 · Cited by 1,457 · cited 1×
“These activities especially include perception, learning, memorization and decision making [23].”
Cognition, Evolution, and Behavior
Shettleworth, S. J. (2009) · doi:10.1093/oso/9780195319842.001.0001 · Cited by 1,453
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284 · cited 1×
“the size of the simulated physical system [2]).”
BackgroundUltimate physical limits to computation
Lloyd, S. (2000) · Nature · doi:10.1038/35023282 · Cited by 1,120 · cited 1×
“Lloyd has shown [19, 20] that the number of bits which can be represented by 1 kg of a matter in a volume of one litre can be of the order at most 10(31).”
Background(1994) · CERN Document Server (European Organization for Nuclear Research) · Cited by 1,062
Luis Balcázar, J., Díaz, J., & Gabarró, J. (1995) · Texts in Theoretical Computer Science An EATCS Series · doi:10.1007/978-3-642-79235-9 · Cited by 866
Research works printed but not linked: 1
- Levin LA. Universal sequential search problems. Probl Inf Transm 1973;9(3):265–66.
Cited by
AI: Unexplainable, Unpredictable, Uncontrollable
Yampolskiy, R. V. (2024) · Chapman & Hall/CRC eBooks · doi:10.1201/9781003440260 · Cited by 58
From Seed AI to Technological Singularity via Recursively Self-Improving SoftwarePreprint
Yampolskiy, R. V. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1502.06512 · Cited by 33
“Wiedermann argues that cognitive systems form an infinite hierarchy and from a computational point of view human-level intelligence is upper-bounded by the ∑ 2 class of the Arithmetic Hierarchy [75].”
BackgroundOn the Limits of Recursively Self-Improving AGI
Yampolskiy, R. V. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-21365-1_40 · Cited by 23
“humans, much faster and more reliably they will still be limited by computational limits found in upper levels of the Arithmetic Hierarchy [16, 17].”
BackgroundInfluentialOn quantum computing for artificial superintelligence
Grabowska, A., & Gunia, A. (2024) · European Journal for Philosophy of Science · doi:10.1007/s13194-024-00584-7 · Cited by 18
“These paths involve the significant acceleration of existing AI algorithms (Moret-Bonillo, 2015; Liu et al., 2021; but see also Wiedermann, 2012) and the emergence of the quantum mind, with its medium being a quantum computer (Penrose, 1994; Mikki, 2023).”
Superintelligence: Myth or Pressing Reality?
Hurlburt, G. F. (2017) · IT Professional · doi:10.1109/mitp.2017.11 · Cited by 13
Metadata
- Authors
- Wiedermann, J.
- Venue
- Cognitive Computation
- Published
- 2012-02-18
- Volume
- 4
- Issue
- 3
- Pages
- 236-245
- ISSN
- 1866-9956 (ISSN-L)
- 1866-9964
- OpenAlex
- W2029932081
- Cited by
- 12
- References
- 36
- Citations by year
- 2026: 1 · 2024: 1 · 2022: 2 · 2021: 2 · 2017: 2 · 2015: 2 · 2014: 1 · 2012: 1
- FWCI
- 1.38
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Cognitive Computation (publishedVersion)
- ASEP (submittedVersion, public-domain)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Computability, Logic, AI Algorithms
- Physical Sciences › Mathematics › Theoretical Computer Science › DNA and Biological Computing
- Physical Sciences › Computer Science › Artificial Intelligence › Cognitive Computing and Networks
- Keywords
- superintelligence, arithmetical hierarchy, human-level intelligence, computability
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A Computability Argument Against Superintelligence. https://app.cochat.ai/papers/10.1007/s12559-012-9124-9
- The paper
- Wiedermann, J. (2012). A Computability Argument Against Superintelligence. Cognitive Computation. https://doi.org/10.1007/s12559-012-9124-9
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.