Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail From: olcott Newsgroups: comp.theory,sci.logic Subject: Re: Two dozen people were simply wrong --- Try to prove otherwise --- pinned down Date: Fri, 31 May 2024 20:10:54 -0500 Organization: A noiseless patient Spider Lines: 119 Message-ID: References: <87y17smqnq.fsf@bsb.me.uk> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Sat, 01 Jun 2024 03:10:56 +0200 (CEST) Injection-Info: dont-email.me; posting-host="5617c6a52e82e3edb2307f1199229213"; logging-data="2595797"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1/iU2lmJ78YC7KcP60ysfzF" User-Agent: Mozilla Thunderbird Cancel-Lock: sha1:o14gFoUF8tm8CEyzN63TTLNqBiY= In-Reply-To: Content-Language: en-US Bytes: 6985 On 5/31/2024 7:39 PM, Richard Damon wrote: > On 5/31/24 7:57 PM, olcott wrote: >> On 5/31/2024 6:33 PM, Richard Damon wrote: >>> On 5/31/24 6:54 PM, olcott wrote: >>>> On 5/31/2024 5:46 PM, Richard Damon wrote: >>>>> On 5/31/24 6:08 PM, olcott wrote: >>>>>> On 5/31/2024 4:36 PM, Richard Damon wrote: >>>>>>> On 5/31/24 10:10 AM, olcott wrote: >>>>>>>> On 5/31/2024 6:16 AM, Richard Damon wrote: >>>>>>>>> On 5/30/24 11:27 PM, olcott wrote: >>>>>>>>>> Try and show how HH using an x86 emulator can correctly emulate >>>>>>>>>> the following x86 machine code such that DD reaches its own >>>>>>>>>> machine address 00001c47. >>>>>>>>> >>>>>>>>> Why should I, since that isn't what I was saying. >>>>>>>>> >>>>>>>> >>>>>>>> *To me that looks like you know that* >>>>>>>> *you have been busted in a lie and are backing down* >>>>>>> >>>>>>> no, YOU are LYING RIGHT HERE AND NOW. >>>>>>> >>>>>>> Prove that I said that the simulation by HH made it there, or >>>>>>> admit to being a DAMNED LIAR. >>>>>>> >>>>>>> What I have been saying is the the DIRECT EXDCUTION of DD, and >>>>>>> the CORRECT (and complete) simulation of the input to HH by an >>>>>>> actual UTM will get there. >>>>>>> >>>>>> >>>>>> That has always been the dishonest dodge strawman deception >>>>>> CHANGE-THE-SUBJECT fake rebuttal regarding >>>>>> the behavior of DD correctly simulated by pure function HH. >>>>> >>>>> But it is your talking about the "correctly simulated by HH" that >>>>> is the dishonest dodge, >>>> >>>> Try and show how HH using an x86 emulator can correctly emulate >>>> the following x86 machine code such that DD reaches its own >>>> machine address 00001c47. >>> >>> Never said it could. But haven't looked hard enough to be willing to >>> say it can't, but then, who cares, it doesn't say a thing about the >>> real halting problem, since H's simulation isn't "correct" by a >>> definition that relates simulation to non-halting behavior, >>> >> >> "...the Turing machine will halt whenever it enters a final state." >> Linz(1990:234) > > Right, and that is talking about runnig the Turing Machine, not > simulating a representation of it. > DD correctly simulated by HH cannot possibly reach its own simulated final state. This is conclusively proven beyond all possible doubt by the x86 machine code of DD. You can lie about this and try to get away with changing the subject. What you cannot do is show that it is not true. *Showing that it is relevant is a whole other different subject that* *we can get to as soon as you quit your deception on this subject* *Showing that it is relevant is a whole other different subject that* *we can get to as soon as you quit your deception on this subject* *Showing that it is relevant is a whole other different subject that* *we can get to as soon as you quit your deception on this subject* >> >> *If DD correctly simulated by HH can't possibly reach its own* >> *final state then DD correctly simulated by HH is non-halting* > Nope, Where did that definition say ANYTHING about one machine > simulationg another. > Trying to get away with saying that you don't "believe in" UTMs can't possibly fool anyone that knows what UTMs are. When Ĥ is applied to ⟨Ĥ⟩ Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞ Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn When embedded_H a UTM then ⟨Ĥ⟩ ⟨Ĥ⟩ correctly simulated by embedded_H cannot possibly reach its own simulated final state of ⟨Ĥ.qn⟩. In this case embedded_H fails to be a decider, however it also proves: that ⟨Ĥ⟩ ⟨Ĥ⟩ correctly simulated by embedded_H cannot possibly reach its own simulated final state of ⟨Ĥ.qn⟩ for any embedded_H based on a UTM that only simulates some finite sequence of steps. "...the Turing machine will halt whenever it enters a final state." Linz(1990:234) ⟨Ĥ⟩ ⟨Ĥ⟩ correctly simulated by embedded_H cannot possibly reach its own simulated final state of ⟨Ĥ.qn⟩ *The input ⟨Ĥ⟩ ⟨Ĥ⟩ to embedded_H SPECIFIES non-halting behavior* *The input ⟨Ĥ⟩ ⟨Ĥ⟩ to embedded_H SPECIFIES non-halting behavior* *The input ⟨Ĥ⟩ ⟨Ĥ⟩ to embedded_H SPECIFIES non-halting behavior* You can lie about this or try to get away with changing the subject. What you cannot do it show that it is not true. *Showing that it is relevant is a whole other different subject that* *we can get to as soon as you quit your deception on this subject* *Showing that it is relevant is a whole other different subject that* *we can get to as soon as you quit your deception on this subject* *Showing that it is relevant is a whole other different subject that* *we can get to as soon as you quit your deception on this subject* -- Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius hits a target no one else can see." Arthur Schopenhauer