Path: csiph.com!weretis.net!feeder9.news.weretis.net!feeder8.news.weretis.net!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail From: Tim Rentsch Newsgroups: comp.lang.c Subject: Re: Can D correctly simulated by H reach its own line 06 and halt? Date: Tue, 21 May 2024 21:23:20 -0700 Organization: A noiseless patient Spider Lines: 27 Message-ID: <86a5kiwk3r.fsf@linuxsc.com> References: MIME-Version: 1.0 Content-Type: text/plain; charset=us-ascii Injection-Date: Wed, 22 May 2024 06:23:20 +0200 (CEST) Injection-Info: dont-email.me; posting-host="ef527a1f0ace8b0bcb46bd1e68f4f6ae"; logging-data="1083171"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+tVFDH/C67IqQXc+rNP7aC+mE3ZWHrKlo=" User-Agent: Gnus/5.11 (Gnus v5.11) Emacs/22.4 (gnu/linux) Cancel-Lock: sha1:B/ODOcBgNkyjYBMSGIb8aAnZ43A= sha1:NmQaRiWkMyWQixpPQAPFYuq0qn0= Xref: csiph.com comp.lang.c:384795 Sam writes: > olcott writes: > >>>> It is essentially trivial to see that D correctly simulated by H >>>> cannot possibly reach its own final state at line 06 because >>>> D correctly simulated by H remains stuck in recursive simulation. >>>> >>>> This provides the basis for simulating termination analyzer H to >>>> correctly determine that the halting problem's counter-example >>>> input D cannot possibly halt. >>> >>> Negative. It is trivial to see that the above code does not >>> execute, and, as such, any claims about what it does or does not >>> do are void, by default. >> >> Oh I forgot to endlessly repeat that that the above is >> a code template such that every H/D pair of the infinite >> set of H/D pairs is only required to correctly simulate >> N steps of D using an x86 emulator. > > Just like any endlessly repeating infinite loop, you're stuck and > will never finish your task. olcott is playing a kind of practical joke, testing to see how long it takes people to realize his personal Turing machine doesn't halt.