Deutsch English Français Italiano |
<v7lped$luh0$2@dont-email.me> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!feeds.phibee-telecom.net!2.eu.feeder.erje.net!feeder.erje.net!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail From: olcott <polcott333@gmail.com> Newsgroups: comp.theory Subject: Re: Liar detector: Fred, Richard, Joes and Alan --- Honest Dialogue ? --- Infinite set of HHH/DDD pairs Date: Mon, 22 Jul 2024 09:13:33 -0500 Organization: A noiseless patient Spider Lines: 100 Message-ID: <v7lped$luh0$2@dont-email.me> References: <v644pn$29t4h$3@dont-email.me> <v6h3cu$ud7p$2@dont-email.me> <v6h83q$vag9$1@dont-email.me> <v6ikgb$19f5g$1@dont-email.me> <v6jgjo$1ctoi$4@dont-email.me> <v6lckp$1qi9e$1@dont-email.me> <v6m2qq$1tj30$6@dont-email.me> <60a1c2490e9bd9a5478fd173a20ed64d5eb158f9@i2pn2.org> <v6nvn8$2bn6q$1@dont-email.me> <v6oqti$2fuva$7@dont-email.me> <v6qn6k$2ubkt$1@dont-email.me> <v6r9q1$30qtt$5@dont-email.me> <v6tbge$3gegs$1@dont-email.me> <v6tqlm$3imib$5@dont-email.me> <v6vvid$24jd$1@dont-email.me> <v70mih$61d8$3@dont-email.me> <v72i9m$jne3$1@dont-email.me> <v7367p$mjis$8@dont-email.me> <v755m4$15kf6$1@dont-email.me> <v75vl9$19j7l$7@dont-email.me> <v77p77$1nm3r$1@dont-email.me> <v78fa7$1rc43$2@dont-email.me> <v7agsg$2am9u$1@dont-email.me> <v7b4l2$2e2aq$2@dont-email.me> <v7d9el$2tp5s$1@dont-email.me> <v7dtqt$30pvh$6@dont-email.me> <v7fu0f$3ff7c$1@dont-email.me> <v7ge24$3hlc2$4@dont-email.me> <v7ikut$1l1s$1@dont-email.me> <v7j3mp$3o7r$4@dont-email.me> <v7l3kg$ifhl$1@dont-email.me> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Mon, 22 Jul 2024 16:13:33 +0200 (CEST) Injection-Info: dont-email.me; posting-host="9aaf30c8a38b34dfe54399611020f1ec"; logging-data="719392"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+t42oyMd4EY+Y+boTGoC6w" User-Agent: Mozilla Thunderbird Cancel-Lock: sha1:z6oovgbeMwjJnfjxkzFnaPMGsFU= Content-Language: en-US In-Reply-To: <v7l3kg$ifhl$1@dont-email.me> Bytes: 5659 On 7/22/2024 3:01 AM, Mikko wrote: > On 2024-07-21 13:50:17 +0000, olcott said: > >> On 7/21/2024 4:38 AM, Mikko wrote: >>> On 2024-07-20 13:28:36 +0000, olcott said: >>> >>>> On 7/20/2024 3:54 AM, Mikko wrote: >>>>> On 2024-07-19 14:39:25 +0000, olcott said: >>>>> >>>>>> On 7/19/2024 3:51 AM, Mikko wrote: >>>>>>> >>>>>>> You apparently mean that no HHHᵢ can simulate the corresponding >>>>>>> DDDᵢ to >>>>>>> its termination? >>>>>> >>>>>> No I don't mean that at all that incorrectly allocates the error >>>>>> to the emulator. >>>>> >>>>> Anyway you did not say that some HHHᵢ can simulate the >>>>> corresponding DDDᵢ >>>>> to its termination. And each DDDᵢ does terminate, whether simulated >>>>> or not. >>>> >>>> *Until you quit lying about this we cannot have an honest dialog* >>> >>> I don't believe that you can have a honest dialog, at least not without >>> a chairman who wants to and can keep the dialog honest. >>> >> >> void DDD() >> { >> HHH(DDD); >> return; >> } >> >> When N steps of DDD are emulated by pure function HHH according >> to the semantics of the x86 language then N steps are emulated correctly. >> >> The subscripts to HHH and DDD pairs are each element of >> the set of positive integers ℤ+ >> >> When we examine the infinite set of every HHH/DDD pair >> such that: >> >> HHH₁ one step of DDD₁ is correctly emulated by HHH₁. >> HHH₂ two steps of DDD₂ are correctly emulated by HHH₂. >> HHH₃ three steps of DDD₃ are correctly emulated by HHH₃. >> ... >> HHHₙ n steps of DDDₙ are correctly emulated by HHHₙ. >> >> Then DDD correctly simulated by any pure function HHH cannot >> possibly reach its own return instruction and halt, therefore >> every HHH is correct to reject its DDD as non-halting. > > That does not follow. It is never correct to reject a halting comoputation > as non-halting. > In each of the above instances DDD never reaches its return instruction and halts. This proves that HHH is correct to report that its DDD never halts. When every element of an infinite set of the DDD of HHH/DDD pairs never halt (all black cats are black) then HHH can report that its DDD never halts (all black cats are cats). Most people here seems intentionally ridiculously stupid when it comes to hypothetical scenarios: _DDD() [00002163] 55 push ebp ; housekeeping [00002164] 8bec mov ebp,esp ; housekeeping [00002166] 6863210000 push 00002163 ; push DDD [0000216b] e853f4ffff call 000015c3 ; call HHH(DDD) [00002170] 83c404 add esp,+04 [00002173] 5d pop ebp [00002174] c3 ret Size in bytes:(0018) [00002174] A correct simulation is defined as emulating the x86 instructions of DDD according to the semantics specified by these instructions. This includes emulating HHH emulating DDD according to the semantics of the x86 instructions of HHH. Within the hypothetical scenario where DDD is correctly emulated by its HHH and this HHH never aborts its simulation neither DDD nor HHH ever stops running. This conclusively proves that HHH is required to abort the simulation of its corresponding DDD as required by the design spec that every partial halt decider must halt and is otherwise not any kind of decider at all. That HHH is required to abort its simulation of DDD conclusively proves that this DDD never halts. -- Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius hits a target no one else can see." Arthur Schopenhauer