Open Research Index

Pure infinitely self-modifying code

Gregory Morse

Palomar Registrypalomar/PALOMAR-2026-10-13-000008Oct 18, 2026cs.LOscore 0

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,…

SourceRepositoryJSON

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/palomar/PALOMAR-2026-10-13-000008
curl -X POST /api/v1/records/palomar/PALOMAR-2026-10-13-000008/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/palomar/PALOMAR-2026-10-13-000008/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'