{"id":"palomar/PALOMAR-2026-10-13-000008","url":"https://github.com/GregoryMorse/smcTuring/tree/a514ef4dbfdd85c0c91242722887177100c84a7f/lean","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-10-13-000008-v2.json","repo":"https://github.com/GregoryMorse/smcTuring","tags":["cs.LO","msc:03D10","msc:68N30","computability","self-modifying-code","lean"],"score":0,"title":"Pure infinitely self-modifying code","trust":"high","domain":"cs.LO","source":"palomar","authors":["Gregory Morse"],"reviews":0,"subject":"cs.LO","summary":"Formalizes the corrected construction of pure infinitely self-modifying code from Gregory Morse's 2018 paper. An unbounded integer-address machine simulates finite Turing machines, preserves halting and divergence, writes code at every computational instruction, and admits a run changing unboundedly many fetched code fields from a literal identity-memory initializer whose memory is proved primitive recursive. Terminal interpreter journals occur on reached halted configurations of the numbered interpreter on the encoded finite input. The development includes a four-register MOV foundation,…","category":"research","comments":0,"disputed":false,"division":"cs","mentions":0,"verified":true,"discussed":0,"published":"2026-10-18","reactions":{},"formalized":true,"formalizes":[{"title":"Pure Infinitely Self-Modifying Code is Realizable and Turing-complete","identifier":"doi:10.24425/119359","relationship":"adapts"},{"title":"mov is Turing-complete","identifier":"https://www.cl.cam.ac.uk/~sd601/papers/mov.pdf","relationship":"formalizes"}]}