analiza aiqbench
This paper establishes a theoretical framework for sustainable recursive self-improvement in Large Language Models by defining "introspection" as the necessary functional analogue to von Neumann's complexity threshold. The authors argue that current Transformer architectures face structural bottlenecks—such as feedforward designs and lack of complete self-access—that prevent true introspection and fixed-point iteration, limiting autonomous evolution to quasi-introspective states. Consequently, achieving safe and stable self-evolving AI requires specific architectural innovations to overcome these computational class constraints before recursive improvement becomes degenerative.
Self-Reference in Large Language Models: The Introspection Threshold for Recursive Self-Improvement
arXiv:2607.04277v2 Announce Type: replace-cross Abstract: The pursuit of self-evolving AI raises a critical question: when is autonomous self-improvement sustainable rather than degenerative? Drawing an analogy to von Neumann's complexity threshold for self-reproducing automata, we argue that sustainable recursive self-improvement in Large Language Models (LLMs) requires a functional analogue: introspection -- the system's capacity to simulate its own operations and target modifications. Grounded in Kleene's Second Recursion Theorem, we demonstrate the theoretical existence of such introspective programs. However, an empirical review reveals that while current LLMs exhibit quasi-introspection (e.g., partial metacognition), they fall short of true introspection due to structural bottlenecks: a lack of complete self-access, the feedforward nature of the Transformer, and computational class constraints that prevent fixed-point iteration. We conclude by outlining architectural paths to cross this complexity threshold and discussing the associated safety implications.
Abstract:The pursuit of self-evolving AI raises a critical question: when is autonomous self-improvement sustainable rather than degenerative? Drawing an analogy to von Neumann's complexity threshold for self-reproducing automata, we argue that sustainable recursive self-improvement in Large Language Models (LLMs) requires a functional analogue: introspection -- the system's capacity to simulate its own operations and target modifications. Grounded in Kleene's Second Recursion Theorem, we demonstrate the theoretical existence of such introspective programs. However, an empirical review reveals that while current LLMs exhibit quasi-introspection (e.g., partial metacognition), they fall short of true introspection due to structural bottlenecks: a lack of complete self-access, the feedforward nature of the Transformer, and computational class constraints that prevent fixed-point iteration. We conclude by outlining architectural paths to cross this complexity threshold and discussing the associated safety implications.
Physics and Society (physics.soc-ph); Artificial Intelligence (cs.AI)
arXiv:2607.04277 [physics.soc-ph]
(or arXiv:2607.04277v2 [physics.soc-ph] for this version)
https://doi.org/10.48550/arXiv.2607.04277 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 227 cuvinte
Subiecte conexe

Deconfusing Corrigibility
AI Alignment Forum · 17 oct. 2026

Research Note: Filtering Subversion-Relevant Information From Pretraining Data Is Feasible
LessWrong · 5 oct. 2026
The J-Space Debate, Agent Swarms, and Pacing Frontier AI - Digital Minds Newsletter #4
LessWrong · 18 sept. 2026
Value Leakage: An LLM’s Answers Are Silently Shaped by Its Own Values
AI Alignment Forum · 31 iul. 2026