2 papers indexed here
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
The limits of algorithmic safety verification for Turing-complete self-modifying systems, the class in which recursive self-improvement takes place, are established, both for a fixed system and across its own modification.
This work isolates the mechanism shared by rewriting, supervision and system comparison, the elevation operator, and proves 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.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
