Co-Recursive Semantic Self-Extension: A Mathematical Foundation for Open-Ended Intelligence

cs.AI Simon Hegelich, Bardh Prenkaj, Habiba Sarhan, Morteza Shahrezaye, Kolja Hegelich, Eric Cambria, Christian Montag · Oct 22, 2026
Local to this browser
What it does
This paper asks why modern AI hits ceilings despite scale, data, and compute, and answers that open-ended intelligence requires co-recursive semantic self-extension: a continuous cycling between object-level inference and meta-level...
Why it matters
Drawing on Kant, Gödel, and Hegel, it argues that fixed architectures—from LLMs to Gödel machines—are inherently bounded, and that only collectives with persistent external memory can escape determinism. It is an ambitious attempt to...
Main concern
The paper offers an intellectually coherent philosophical synthesis framed as a mathematical foundation, but its formal contributions are far narrower than its rhetorical ambitions. Its seven "laws" of intelligent systems are presented as...
Community signal
0
0 up · 0 down
Sign in to vote with arrows
AI Review AI reviewed
Plain-language introduction

This paper asks why modern AI hits ceilings despite scale, data, and compute, and answers that open-ended intelligence requires co-recursive semantic self-extension: a continuous cycling between object-level inference and meta-level transformation of both formal languages and goals. Drawing on Kant, Gödel, and Hegel, it argues that fixed architectures—from LLMs to Gödel machines—are inherently bounded, and that only collectives with persistent external memory can escape determinism. It is an ambitious attempt to reframe AGI as a logical process of indefinite semantic reconstruction.

Critical review
Verdict
Bottom line

The paper offers an intellectually coherent philosophical synthesis framed as a mathematical foundation, but its formal contributions are far narrower than its rhetorical ambitions. Its seven "laws" of intelligent systems are presented as necessary consequences of Kantian and Gödelian insights, yet they function as speculative design axioms rather than derived theorems. Propositions 1 and 2 in §4 recast elementary logical facts—essentially, that unclosed proof traces of undecidable sentences must encounter undecidable intermediate premises—within an elaborate vocabulary of "determinate negation" and "reflective reification." The leap from these logical constructions to a workable AGI architecture remains entirely unsupported.

“the plateau is a structural consequence of optimizing within a fixed semantic domain, not of limited computational resources”
“the Gödel machine remains bound to the deductive closure of its starting formalism”
What holds up

The critique of fixed-purpose optimization is clearly articulated and structurally sound. The authors correctly observe that "performance saturates" within a fixed semantic domain and that the ceiling is a structural feature of the domain itself. Their distinction between $I^{loc}(O_n)$ and $I^{inc}(O_n)$—propositions that are merely undecided versus genuinely undecidable within the current system—provides a useful formal vocabulary for discussing when incremental learning ends and structural transformation is required. The insistence on reflective adequacy via structure-preserving translations $\tau_n$ is a concrete logical device that prevents successor systems from losing track of their predecessors.

“performance saturates”
“the incomplete derivation—which at the object level is merely the failed form of a proof—becomes, when reflected upon by the meta-level, a determinate content”
Main concerns

The central flaw is the enormous gap between abstract formalism and architectural realizability. Proposition 1, while correctly proved, is mathematically trivial: if $x$ is undecidable and truth-functionally reduces to a finite frontier $\mathcal{B}_{n,t}(x)$, some premise in that frontier must also be undecidable; otherwise $x$ would be decidable. This follows directly from the definitions, not from a deep discovery about cognition. Proposition 2 simply notes that adjoining an undecidable $b$ or its negation yields distinct consistent extensions, a standard Lindenbaum-style observation. The paper drapes these elementary results in Hegelian terminology—"the real issue is not exhausted by stating it as an aim, but by carrying it out" (§4.2)—which obscures rather than strengthens the logical content.\n\nFurthermore, the claim that "using Kolmogorov complexity, we show that no architecture with a fixed state description... can generate histories incorporating irreducible algorithmic information" (Abstract) is asserted but not developed in the provided text, leaving the key impossibility result for single agents as an unsupported promissory note. The appeal to "collectives" with "persistent external memory" as the solution is equally vague: no mechanism is given for how such memory preserves semantic coordinates, nor is the balance between "overlap for transfer with difference for generation" quantified. The repeated citation of He et al. (2026) as a principal foil is suspicious because the paper itself is dated October 2026, making the target contemporaneous and unverifiable.

“using Kolmogorov complexity, we show that no architecture with a fixed state description, transition mechanism, and initial condition can generate histories incorporating irreducible algorithmic information”
Hegelich et al. · Abstract
“the real issue is not exhausted by stating it as an aim, but by carrying it out”
Evidence and comparison

The paper provides no empirical evidence and no running model; its arguments are purely logical and philosophical. The comparisons to related work are uneven. The dismissal of neuro-symbolic AI as combining "the weaknesses of both parents" (§1) is glib and ignores substantial recent progress in neural theorem proving and differentiable reasoning. The critique of Schmidhuber's Gödel machine is more nuanced: the paper correctly notes that it may only replace axioms with "theorems derivable from the original axioms" and alter utility "only if their new values are provably better according to the old ones" (§2, quoting Schmidhuber, 2006). However, the paper's own co-recursive alternative offers no algorithmic procedure for generating successor languages $L_{n+1}$ from $L_n$ in any computationally effective way; it simply posits an admissible set $\mathcal{E}(\mathcal{F}_n)$. Without specifying the generative rules, the framework cannot be shown to escape the very boundedness it attributes to others.

“the weaknesses of both parents”
“only if their new values are provably better according to the old ones”
Reproducibility

Reproduction is impossible. There is no code, no algorithms, no data, and no experimental protocol. The paper defines operators such as the teleological transformation $\mathcal{T}(H_n, E_n)$ and the meta-level selection operator $\mathcal{M}_n$, but gives no computable implementation or even pseudocode for how these would operate in a physical system. The formal propositions assume oracular abilities to construct "trace-objectifying families" and "conservative reflective diagrams" $\Phi_{tr}(\pi_{n,t}(x))$; whether such diagrams can be automatically synthesized for non-trivial domains is entirely unresolved. The requirement for "persistent external memory preserving semantic content and historical coordinates" (Abstract) is stated as a logical necessity but never instantiated. As a design document, the paper offers architecture at the altitude of pure metaphysics.

“persistent external memory preserving semantic content and historical coordinates”
Hegelich et al. · Abstract
“conservative reflective diagrams”
Abstract

Artificial intelligence has advanced through scale, data, and computation, yet remains bounded by its representational framework. We ask what makes intelligence open-ended. Every inferential system selects meaningful distinctions, limiting what it can learn. Within a fixed purpose, performance reaches a ceiling set by its semantic domain. Teleological succession, in which purposes arise from earlier ones, faces a similar limit: Boolean-closed purpose-transformations exhaust their reachable semantic territory. We shift from purposes to inferential systems. Drawing on Kant and G\"odel, we model cognitive states as partial evaluations over a formal language. Unresolved propositions may be undecided or undecidable. Reasoning can resolve the former but not the latter, leaving a frontier for extension. Non-trivial reductions of undecidable propositions expose undecidable intermediate premises whose reflective reification supports multiple decisive extensions. Finite trace-guided generation remains fallible, requiring meta-level selection and polycontextural exploration. Using Kolmogorov complexity, we show that no architecture with a fixed state description, transition mechanism, and initial condition can generate histories incorporating irreducible algorithmic information. Because physical systems are fixed in this sense, we examine collectives. Coupling finitely many finite agents does not remove the bound. Extension requires persistent external memory preserving semantic content and historical coordinates. Collective generative capacity depends on balancing overlap for transfer with difference for generation. We propose semantic self-extension as a design principle: intelligence should not merely resolve ambiguity within existing meanings, but transform unresolved structures into new spaces of meaning, generating new distinctions, questions, representations, and purposes.

Challenge the Review

Pick a starting point or write your own. Challenges run in the background, so you can keep reading while the AI investigates.

No challenges yet. Disagree with the review? Ask the AI to revisit a specific claim.