Metraipolis › archive › dc_7e9ffeb8d5d6
Rice's Theorem under Self-Modification: Elevation Operators and a Normal Form — arXiv:2609.11326
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.11326
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T05:27:02.057Z
- SHA-256 of the archived text
3cb13d32ba93c1a2778c81be499e143da6f66e83571ab6119591bf5c562725f8- Stable URL of this page
https://metraipolis.com/documento/dc_7e9ffeb8d5d6
How to cite
Rice's Theorem under Self-Modification: Elevation Operators and a Normal Form — arXiv:2609.11326 — arXiv (en), https://arxiv.org/abs/2609.11326 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7e9ffeb8d5d6 (Metraipolis archive dc_7e9ffeb8d5d6, sha256 3cb13d32ba93c1a2778c81be499e143da6f66e83571ab6119591bf5c562725f8)
BibTeX
@misc{dc7e9ffeb8d5d6,
title = {Rice's Theorem under Self-Modification: Elevation Operators and a Normal Form — arXiv:2609.11326},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.11326},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7e9ffeb8d5d6; sha256 3cb13d32ba93c1a2778c81be499e143da6f66e83571ab6119591bf5c562725f8},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.11326. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We ask whether it can be certified algorithmically that a self-modifying program keeps a behavioural property, a safety property in the motivating case, after its next rewrite (preservation) and along its whole evolution (persistence). When the rewrite depends only on behaviour, preservation is a behavioural property and Rice's theorem applies. When the rewrite reads the code, preservation is no longer behavioural; yet, under a uniform disruption condition, the s-m-n reduction that proves Rice's theorem works inside a single class of behaviourally identical programs, and preservation inherits the degree of the halting problem. One step never exceeds the degree of the property, while persistence can climb one level of the arithmetical hierarchy. We then isolate the mechanism shared by rewriting, supervision and system comparison, the elevation operator, and prove a normal form: the preserving set is determined by a single finite trigger and a polarity, and the Rice-Shapiro theorem restricts the polarity to the arithmetical class of the property. Runtime monitors, consistency supervision, conformance to a reference and observational equivalence are instances, and no sound theory covers the preserving systems. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-11 in cs.AI). Categorie arXiv: Logic in Computer Science (cs.LO) ; Artificial Intelligence (cs.AI); Computation and Language (cs.CL); Logic (math.LO). Pagina del lavoro: https://arxiv.org/abs/2609.11326 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T05:17:52.148Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).