arXiv Paper Formalises Preservation of Undecidable Properties in Self-Modifying Systems

A new arXiv preprint introduces a formal operator, termed the semantic elevation operator, to analyse how static semantic properties behave when a system rewrites its own code. While Rice's theorem establishes the undecidability of such properties for ordinary programs, the paper examines whether undecidability is closed, or preserved, under self-modification. The work targets the theoretical foundations needed to reason about programs whose behaviour changes as they edit themselves.