On 2019-05-15, at 13:39:11, Tony Harminc wrote: > > Very interesting. The Halting Problem and its nifty proof of > non-computability is something everyone learns in the first CompSci course, > but I have never given computability of self-modification any thought. Is > there a similar nifty proof for this one? ... > Make your program a subroutine of a main program that stores into itself if that subroutine halts. This makes self-modification equivalent to the halting problem.
More practical, mark your module REFR and run with REFRPROT in effect. -- gil
