News for hackers. Stuff that matters.
Re:Scooping the Loop Snooper: Proof That the Halting Problem... by nils-m-holm on Friday September 13, 2019 @03:24AM (#20959940)
But without infinity, a system cannot examine itself, only subsets of itself. Even for the two copies in lockstep, you need a system at least two times as big as the one being examined.
Re:Scooping the Loop Snooper: Proof That the Halting Problem... by whatshisface on Friday September 13, 2019 @08:21AM (#20961408)
I disagree, look at quines. Systems can contain copies of themselves if they can be compressed.
Re:Scooping the Loop Snooper: Proof That the Halting Problem... by nils-m-holm on Friday September 13, 2019 @08:29AM (#20961469)
A quine prints a copy of itself, it does not contain a copy of itself. The copy contained in the quine is not executable in its compressed form.
Re:Scooping the Loop Snooper: Proof That the Halting Problem... by tjhance on Friday September 13, 2019 @08:44AM (#20961551)
There is a general theorem that says that for any computation, you can write a program that executes that computation on its own source code. The quine is only a special case.
Re:Scooping the Loop Snooper: Proof That the Halting Problem... by Animats on Friday September 13, 2019 @03:53AM (#20960065)
Two is much smaller than infinity.
Re:Scooping the Loop Snooper: Proof That the Halting Problem... by nils-m-holm on Friday September 13, 2019 @06:59AM (#20960953)
But the 2x systems still cannot examine itself, but only half of it (being optimistic, because in addition to the 2x you also need the logic doing the stepping and the comparison). There is no finite system that is a true subset of itself.