1 paper · 1 filter
Gregory Morse, Tamás Kozsik
Classical computability theory tells us that self-modifying code (SMC) on a deterministic universal Turing machine can be simulated by non-SMC code on the same model. That abstract…