Path: ...!eternal-september.org!feeder3.eternal-september.org!i2pn.org!i2pn2.org!.POSTED!not-for-mail From: Richard Damon Newsgroups: comp.theory Subject: =?UTF-8?Q?Re=3A_Analysis_of_Flibble=E2=80=99s_Latest=3A_Detecting_v?= =?UTF-8?Q?s=2E_Simulating_Infinite_Recursion_ZFC?= Date: Fri, 23 May 2025 21:33:32 -0400 Organization: i2pn2 (i2pn.org) Message-ID: <21ed35131aaf07276d474449f7ba8af3887e5e19@i2pn2.org> References: <100ktr7$2reaa$1@dont-email.me> <100l09v$2tae8$5@dont-email.me> <100l1ov$2ul3j$1@dont-email.me> <100l3jh$2v0e9$1@dont-email.me> <100l5c8$2ul3j$2@dont-email.me> <100l75g$2vpq3$1@dont-email.me> <100l887$2ul3i$2@dont-email.me> <100l9gh$30aak$1@dont-email.me> <100lc4o$30pgm$1@dont-email.me> <100ld1u$312c9$1@dont-email.me> <100lg4g$31jt3$1@dont-email.me> <100lkdv$32ib3$1@dont-email.me> <100lmif$32v06$1@dont-email.me> <100lmp3$32ven$1@dont-email.me> <100m319$38k55$2@dont-email.me> <87jz69xlpx.fsf@nosuchdomain.example.com> <100mder$39slu$2@dont-email.me> <100oipb$3oge1$1@dont-email.me> <87a573xz0s.fsf@bsb.me.uk> <875xhrtbpr.fsf@nosuchdomain.example.com> <87y0umx63u.fsf@bsb.me.uk> <100r10u$am31$1@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Sat, 24 May 2025 01:43:35 -0000 (UTC) Injection-Info: i2pn2.org; logging-data="1664535"; mail-complaints-to="usenet@i2pn2.org"; posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg"; User-Agent: Mozilla Thunderbird Content-Language: en-US X-Spam-Checker-Version: SpamAssassin 4.0.0 In-Reply-To: <100r10u$am31$1@dont-email.me> Bytes: 4371 Lines: 66 On 5/23/25 7:40 PM, olcott wrote: > On 5/23/2025 6:25 PM, Ben Bacarisse wrote: >> Keith Thompson writes: >> >>> Ben Bacarisse writes: >>>> Mike Terry writes: >>> [...] >>>> And the big picture is that this can be done because false is the >>>> correct halting decision for some halting computations.  He has said >>>> this explicitly (as I have posted before) but he has also explained it >>>> in words: >>>> >>>> | When-so-ever a halt decider correctly determines that its input would >>>> | never halt unless forced to halt by this halt decider this halt >>>> | decider has made a correct not-halting determination. >>> >>> Hmm.  I don't read that the way you do.  Did I miss something? >>> >>> It assumes that the input is a non-halting computation ("its input >>> would never halt") and asserts that, in certain circumstances, >>> his mythical halt decider correctly determines that the input >>> is non-halting. >>> >>> When his mythical halt decider correctly determines that its input >>> doesn't halt, it has made a correct non-halting determination. >>> It's just a tautology. >> >> It would be a tautology but for the "unless..." part.  It does not make >> the determination that it does not halt.  It determines that it would >> not halt were it not for the fact that the decider (a simulation) in >> fact halts it. >> > > Still a tautology. > When the simulated input specifies a non-halting sequence > of configurations as proven by the fact that DD simulated > by HHH would never stop running unless aborted, > THIS TOO IS A TAUTOLOGY. But only *IF* the decider DOES correctly simulate it, which means it can't abort it. Sorry, the condition needs to be ALWAYS true, even after it is used, to be used. > > Fools here want to ignore the that the input to HHH(DD) > specifies a non-halting sequence of configurations and > instead have HHH report on some other basis. > > int main() > { >   DD(); // HHH cannot report on the behavior of its caller > }       // Thus HHH cannot report on the behavior of the >         // direct execution of DD(); > > Most of my reviewers are screwball trolls not giving > a rat's ass for truth. > And you are just proving that you are a fool that doesn't know what you are talking about. You admit that you HHH and DD are not programs, and thus everything you say about them under the guise that they are programs is just a LIE. That you don't understand this just shows your stupidity.