arXiv:2604.19845v2 Announce Type: replace
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 $mathcalA$ with update $hatU$, discrimination $hatD$, and self-representation $hatR$, identifying the supplement with $mathrmComm(hatU)$; an expansion theorem shows that $[hatU,hatR]$ decomposes through $[hatU,hatD]$, so non-commutation generically propagates. The liar paradox appears as a commutator collapse $[hatT,Pi_L]=0$, and class $mathbfA$ self-modification realises the same collapse at system scale, yielding a structure coinciding with Priest’s inclosure schema and Derrida’s diff`erance.
Evaluating LLM-Based Goal Extraction in Requirements Engineering: Prompting Strategies and Their Limitations
arXiv:2604.22207v1 Announce Type: cross Abstract: Due to the textual and repetitive nature of many Requirements Engineering (RE) artefacts, Large Language Models (LLMs) have proven useful