Deutsch English Français Italiano |
<bb7bfc4764ecf8b79983d376ce7ec2eaa1c196d0@i2pn2.org> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!news.misty.com!weretis.net!feeder9.news.weretis.net!i2pn.org!i2pn2.org!.POSTED!not-for-mail From: Richard Damon <richard@damon-family.org> Newsgroups: comp.theory,sci.logic Subject: Re: Liar detector: Fred, Richard, Joes and Alan --- Ben's agreement Date: Sat, 6 Jul 2024 11:24:05 -0400 Organization: i2pn2 (i2pn.org) Message-ID: <bb7bfc4764ecf8b79983d376ce7ec2eaa1c196d0@i2pn2.org> References: <v644pn$29t4h$3@dont-email.me> <v645v1$29pag$3@dont-email.me> <v646v5$2agfo$1@dont-email.me> <v647p3$29pag$6@dont-email.me> <v6480h$2ape0$1@dont-email.me> <v648nk$29pag$8@dont-email.me> <v64as3$2bc8m$1@dont-email.me> <v64drn$29pag$10@dont-email.me> <v64e92$2bvgc$1@dont-email.me> <v65juc$2lui5$2@dont-email.me> <v665c9$2oun1$4@dont-email.me> <v66t0p$2n56v$1@dont-email.me> <v66t7p$2srk8$1@dont-email.me> <v66tql$2n56v$3@dont-email.me> <v66u56$2suut$1@dont-email.me> <v66v8i$2n56v$4@dont-email.me> <v67028$2t9el$1@dont-email.me> <v68b3f$2n56v$5@dont-email.me> <v68ocd$39dkv$5@dont-email.me> <v68pfo$2n56v$7@dont-email.me> <v68rnv$39tml$2@dont-email.me> <v68tvd$3ac9t$1@dont-email.me> <v68uj0$3ahel$1@dont-email.me> <v694k4$3bevk$1@dont-email.me> <v69502$3bh3f$1@dont-email.me> <v6b1k4$3odj5$1@dont-email.me> <v6bf7r$3qiio$2@dont-email.me> <v6bm5v$3rj8n$1@dont-email.me> <v6bmoe$3ri0l$2@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Sat, 6 Jul 2024 15:24:05 -0000 (UTC) Injection-Info: i2pn2.org; logging-data="2360218"; mail-complaints-to="usenet@i2pn2.org"; posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg"; User-Agent: Mozilla Thunderbird In-Reply-To: <v6bmoe$3ri0l$2@dont-email.me> X-Spam-Checker-Version: SpamAssassin 4.0.0 Content-Language: en-US Bytes: 8496 Lines: 158 On 7/6/24 11:10 AM, olcott wrote: > On 7/6/2024 10:00 AM, Fred. Zwarts wrote: >> Op 06.jul.2024 om 15:01 schreef olcott: >>> On 7/6/2024 4:09 AM, Fred. Zwarts wrote: >>>> Op 05.jul.2024 om 17:54 schreef olcott: >>>>> On 7/5/2024 10:48 AM, Fred. Zwarts wrote: >>>>>> Op 05.jul.2024 om 16:05 schreef olcott: >>>>>>> On 7/5/2024 8:54 AM, Fred. Zwarts wrote: >>>>>>>> >>>>>>>> HHH cannot possibly correctly simulate itself. >>>>>>>> >>>>>>> LIAR! I give up on you. >>>>>>> https://liarparadox.org/HHH(DDD)_Full_Trace.pdf >>>>>> >>>>>> No need to come back, because you are unable to point to any error >>>>>> in my reasoning. >>>>> >>>>> I conclusively proved that HHH is correctly simulating itself >>>>> simulating DDD and you simply freaking lie about it. >>>>> >>>>>> Your replies are only irrelevant, or supporting my reasoning. I >>>>>> showed that HHH cannot possibly simulate itself correctly and your >>>>>> full trace supports this, as it shows that the simulating HHH is >>>>>> unable to reach the 'ret' of the simulated HHH. >>>>>> >>>>> >>>>> *Unable to reach ret IS A FREAKING CORRECT FREAKING SIMULATION* >>>> >>>> Unable to reach ret *is a freaking demonstration* of an incorrect >>>> simulation. >>>> >>> >>> If it was incorrect you would have to show which >>> x86 instruction was simulated incorrectly. You >>> can't do that because it is a matter of verified >>> fact that none of them were simulated incorrectly. >> >> Incorrect reasoning. > > I commented at the wrong place. > > The semantics of the x86 language are the only criterion > measure of correct emulation. Only stupid liars would disagree. And the semantic of the x86 language says that stopping the simulation results in partial results and not a prediction of what will happen in the future with the code. Your HHH can (maybe) determine that it can not partially simulate the input code to the return instruction, but if it stops and returns, it can not conclude that the input, when PROPERLY and COMPLETELY emulated (or just ran) will not do so. You just don't understand the limitations of PARTIAL simulation, even if it was "correct" for each of its steps (with the exception of stopping when it did). > > Smart liars would not disagree because they would know how > stupid this makes them look. Smart liars would disagree on > much more subtle things. No, but Smart Truth tells will point out your errors. Maybe you should try to learn from "Smart Liars" as it seems so far you are just a "Stupid Liar" that leaves you lies so exposed. > >> Is it really over your head? The simulated instructions are correct, >> but the instructions that are not simulated make the simulation >> incorrect. The simulation is aborted too soon. One cycle later the >> simulated HHH would abort and halt. That part of the input is >> neglected by your simulation, which makes it incorrect, because it >> should process the whole input, not only the first part. >> >>> >>>>> The machine code specifies that DDD simulated by HHH according >>>>> to the semantics of the x86 language cannot possibly reach the >>>>> ret instruction of DDD or its correctly simulated self. >>>>> >>>>> _DDD() >>>>> [00002172] 55 push ebp ; housekeeping >>>>> [00002173] 8bec mov ebp,esp ; housekeeping >>>>> [00002175] 6872210000 push 00002172 ; push DDD >>>>> [0000217a] e853f4ffff call 000015d2 ; call HHH(DDD) >>>>> [0000217f] 83c404 add esp,+04 >>>>> [00002182] 5d pop ebp >>>>> [00002183] c3 ret >>>>> Size in bytes:(0018) [00002183] >>>>> >>>>> >>>> >>>> Your traces shows that HHH aborts the simulation at a point there >>>> the simulated HHH has only one cycle to go before it would abort and >>>> halt. >>> >>> All of the HHH have the same code. The outer HHH >>> meets its abort criteria first. It is a verified >>> fact that unless the outer HHH aborts then none >>> of them do. This violates this correct criteria >> >> Incorrect reasoning. >> Dreaming of an HHH that does not abort is irrelevant. This HHH *does* >> abort. The outer one does, so all of them do. Therefore, the HHH >> simulated by the outer one is aborted one cycle before it would abort >> and halt, as well. That makes the abort premature. >> HHH cannot possibly simulate itself correctly. >> >>> >>> <MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022> >>> If simulating halt decider H correctly simulates its input D >>> until H correctly determines that its simulated D would never >>> stop running unless aborted then >>> >>> H can abort its simulation of D and correctly report that D >>> specifies a non-halting sequence of configurations. >>> </MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022> >>> >> >> Incorrect reasoning. >> You forget pretty soon you have been told many times that Sipser does >> not apply here. You keep repeating this irrelevant text. It is >> irrelevant, because it is about a correct simulation, not about an >> incorrect simulation. >> >>>> So, the only reason why this simulation does not reach the 'ret' of >>>> the simulated HHH, is that it is aborted prematurely. >>>> A correct simulation by another simulator shows that this is indeed >>>> the case. >>> >>> HHH1 can wait for HHH to abort because DDD does not call HHH1. >>> HHH cannot wait because DDD calls HHH. >>> >>>> HHH cannot possible simulate *itself* correctly. This code and your >>>> trace demonstrates this. The fact that the simulation does not reach >>>> the 'ret', where other simulator can do that, demonstrates that >>>> HHH's simulation of itself is incorrect. >>>> >>>> The only thing you brought in against it, is a baseless repetition >>>> that you still belief that the simulation is correct. >>>> >>>> HHH that aborts and halts can be compared to a bear running at you >>>> to kill you: >>>> >>>> All other simulators will tell you that HHH aborts and halts. >>>> All people will warn you that the bear is running at you and will >>>> kill you. >>>> >>>> Only when HHH simulates itself, it says: not aborting and non-halting. >>>> The bear says about itself: I am not running and I will not kill you. >>>> >>>> What do you trust? >>> >>> I only trust correct reasoning. >> >> So, trust my correct reasoning. Not your own incorrect reasoning. >> >