Path: ...!weretis.net!feeder9.news.weretis.net!news.quux.org!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail From: dbush Newsgroups: comp.theory Subject: Re: Every sufficiently competent C programmer knows --- Very Stupid Mistake or Liars Date: Thu, 13 Mar 2025 11:09:11 -0400 Organization: A noiseless patient Spider Lines: 48 Message-ID: References: MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Thu, 13 Mar 2025 16:09:10 +0100 (CET) Injection-Info: dont-email.me; posting-host="416957debdcb20d9b566cd00245152da"; logging-data="3561448"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX18QCgY/qlvOfzDgSOZqnNHp" User-Agent: Mozilla Thunderbird Cancel-Lock: sha1:DS9KYsrx/IUlRAKwQjihswNn3gk= Content-Language: en-US In-Reply-To: Bytes: 2839 On 3/13/2025 11:04 AM, olcott wrote: > void DDD() > { >   HHH(DDD); >   return; > } > > When HHH correctly emulates N steps of the > above DDD it cannot possibly reach its own > "return" instruction and terminate normally. > Irrelevant, as that's not what the halting problem is about. > On 3/13/2025 8:55 AM, dbush wrote: >> On 3/13/2025 9:41 AM, olcott wrote: >>> I created DDD because >>> some of my reviewers are not technically competent >>> enough to see that line 2 of DD is unreachable code >>> when N steps of DD are correctly simulated by HHH. >>> >> >> But it *is* reachable code when DD is executed directly, > > Because the directly executed code like DDD correctly > emulated by HHH1 > DOES NOT HAVE THE PATHOLOGICAL SELF-REFERENCE OF > CALLING ITS OWN EMULATOR YOU NITWIT. > > It is like you really really believe that sum(2,3) == 7 > even though the sum of 2 + 3 == 5. > We don't care about the instance of DDD being simulated by a particular simulator. We're interested in the hypothetical case where DDD is executed directly, which is what a solution to the halting problem is stipulated to report: Given any algorithm (i.e. a fixed immutable sequence of instructions) X described as with input Y: A solution to the halting problem is an algorithm H that computes the following mapping: (,Y) maps to 1 if and only if X(Y) halts when executed directly (,Y) maps to 0 if and only if X(Y) does not halt when executed directly