Deconstructing Superintelligence: Identity, Self-Modification and Diff\'erance

arXiv cs.AI / 4/23/2026

💬 OpinionIdeas & Deep AnalysisModels & Research

Key Points

  • The paper argues that “self-modification” alone is not sufficient for artificial superintelligence (SI) because modification depends on an additional “supplement” that lies outside the system’s operation.
  • It formalizes this idea using an associative operator algebra with operators for update, discrimination, and self-representation, where the supplement is identified with the commutant of the update operator.
  • An expansion theorem shows that the commutator between update and self-representation decomposes through the commutator between update and discrimination, implying that non-commutation can propagate through the system.
  • The work interprets the liar paradox as a commutator collapse and claims that a class of self-modifying systems exhibits a similar collapse at the system level, connecting the result to Priest’s inclosure schema and Derrida’s différance.

Abstract

Self-modification is often taken as constitutive of artificial superintelligence (SI), yet modification is a relative action requiring a supplement outside the operation. When self-modification extends to this supplement, the classical self-referential structure collapses. We formalise this on an associative operator algebra \mathcal{A} with update \hat{U}, discrimination \hat{D}, and self-representation \hat{R}, identifying the supplement with \mathrm{Comm}(\hat{U}); an expansion theorem shows that [\hat{U},\hat{R}] decomposes through [\hat{U},\hat{D}], so non-commutation generically propagates. The liar paradox appears as a commutator collapse [\hat{T},\Pi_L]=0, and class \mathbf{A} self-modification realises the same collapse at system scale, yielding a structure coinciding with Priest's inclosure schema and Derrida's diff\`erance.