Deutsch English Français Italiano |
<usea2c$1hofh$2@dont-email.me> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail From: olcott <polcott2@gmail.com> Newsgroups: comp.theory,sci.logic Subject: Re: We finally know exactly how H1(D,D) derives a different result than H(D,D) Date: Fri, 8 Mar 2024 00:09:15 -0600 Organization: A noiseless patient Spider Lines: 32 Message-ID: <usea2c$1hofh$2@dont-email.me> References: <usda7b$18hee$1@dont-email.me> <usdf9p$15934$2@i2pn2.org> <usdh1e$19t14$1@dont-email.me> <usdi0i$15ejn$1@i2pn2.org> <usdkf8$1aheg$1@dont-email.me> <use0kt$15q44$2@i2pn2.org> <use72e$1hb1j$1@dont-email.me> <use85c$167tc$3@i2pn2.org> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Fri, 8 Mar 2024 06:09:16 -0000 (UTC) Injection-Info: dont-email.me; posting-host="cbe692f823dc8310f00dd0aaf1f84978"; logging-data="1630705"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX1+CoFP6E+ey/ipEJEAH5Vcy" User-Agent: Mozilla Thunderbird Cancel-Lock: sha1:AqMHkXJMoLTHaxU+9t73UXj6GTs= In-Reply-To: <use85c$167tc$3@i2pn2.org> Content-Language: en-US Bytes: 2523 On 3/7/2024 11:36 PM, Richard Damon wrote: > On 3/7/24 9:18 PM, olcott wrote: >> Olcott machines can compute the difference between H1(D,D) and H(D,D) >> because Olcott machines can correctly determine whether or not they >> themselves were called in recursive simulation. >> >> For H1(D,D) and H(D,D)it is the extra inputs of 00001422 and 00001522 >> For H ⟨Ĥ⟩ ⟨Ĥ⟩ <H> and Ĥ.H ⟨Ĥ⟩ ⟨Ĥ⟩ <Ĥ> the extra inputs are shown. >> >> When I keep repeating the above a few hundred more times >> you will quit immediately forgetting that I ever said it. > > All you have done is show why your H / H1 have been disqualified from > being Halt Deciders. Not at all. Not in the least little bit. I have proved that a slight reconfiguration of Turing machines defines a machine that is exactly a Turing machine except can always correctly determine whether or not itself is called in recursive simulation. > They are not Computations using only the description of the Computation > to be decided on. > > This PROVES that they are not correct Halt Deciders. > > And you are proved to be just a pathetic and pathological liar. -- Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius hits a target no one else can see." Arthur Schopenhauer