Sujet : Re: Simulating termination analyzers by dummies --- What does halting mean?
De : noreply (at) *nospam* example.com (joes)
Groupes : comp.theory sci.logicDate : 18. Jun 2024, 18:57:14
Autres entêtes
Organisation : i2pn2 (i2pn.org)
Message-ID : <v4shpp$cbcu$2@i2pn2.org>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17
User-Agent : Pan/0.145 (Duplicitous mercenary valetism; d7e168a git.gnome.org/pan2)
Am Tue, 18 Jun 2024 12:25:44 -0500 schrieb olcott:
On 6/18/2024 12:06 PM, joes wrote:
void DDD()
{
H0(DDD);
}
DDD correctly simulated by any H0 cannot possibly halt.
DDD halts iff H0 halts.
So H0 returns "doesn't halt" to DDD, which then stops running,
so H0 should have returned "halts".
Some TM's loop and thus never stop running, this is classical
non-halting behavior. UTM's simulate Turing machine descriptions.
This is the same thing as an interpreter interpreting the source-code of
a program.
Some TMs do not loop and do not halt.
A UTM can be adapted so that it only simulates a fixed number of
iterations of an input that loops. When this UTM stops simulating this
Turing machine description we cannot correctly say that this looping
input halted.
Yes. We also cannot say that that input was simulated correctly.
-- joes
…