Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail From: olcott Newsgroups: comp.theory Subject: Re: Incorrect requirements --- Computing the mapping from the input to HHH(DD) Date: Sat, 10 May 2025 21:19:34 -0500 Organization: A noiseless patient Spider Lines: 72 Message-ID: References: <11cc09876004107c47467b9481f614f45f450f2c.camel@gmail.com> <674a661e498281cca55b322cbd5905a1988a6171.camel@gmail.com> <088556c03067d8de7184bf88dd01cc6b8c99ba1b.camel@gmail.com> <09cea75db07408dc9203aca3fb74408ad3a095b4.camel@gmail.com> <853816e160c7b3fe75c71f0728e72989d9fb2e41.camel@gmail.com> MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Date: Sun, 11 May 2025 04:19:35 +0200 (CEST) Injection-Info: dont-email.me; posting-host="ef7faca461217fa132b1f53eef89d0be"; logging-data="4036274"; mail-complaints-to="abuse@eternal-september.org"; posting-account="U2FsdGVkX18h+R4H696w613Xne0dblvW" User-Agent: Mozilla Thunderbird Cancel-Lock: sha1:rz5iLQQg6CRaYlbuqU+8wQ5KzZY= X-Antivirus: Norton (VPS 250510-6, 5/10/2025), Outbound message In-Reply-To: <853816e160c7b3fe75c71f0728e72989d9fb2e41.camel@gmail.com> Content-Language: en-US X-Antivirus-Status: Clean Bytes: 4288 On 5/10/2025 9:09 PM, wij wrote: > On Sat, 2025-05-10 at 20:56 -0500, olcott wrote: >> On 5/10/2025 8:44 PM, wij wrote: >>> On Sat, 2025-05-10 at 20:26 -0500, olcott wrote: >>>> On 5/10/2025 8:17 PM, wij wrote: >>>>> On Sat, 2025-05-10 at 17:03 -0500, olcott wrote: >>>>>> On 5/10/2025 4:44 PM, wij wrote: >>>>>>> On Sat, 2025-05-10 at 14:29 -0500, olcott wrote: >>>>>>>> On 5/10/2025 2:02 PM, wij wrote: >>>> >>>>> >>>>> You don't know the counter example in the HP proof, your D is not the case what HP says. >>>>> >>>> >>>> Sure I do this is it! (as correctly encoded in C) >>>> >>>> typedef void (*ptr)(); >>>> int HHH(ptr P); >>>> >>>> int DD() >>>> { >>>>     int Halt_Status = HHH(DD); >>>>     if (Halt_Status) >>>>       HERE: goto HERE; >>>>     return Halt_Status; >>>> } >>>> >>>> int main() >>>> { >>>>     HHH(DD); >>>> } >>>> >>>> >>> >>> Try to convert it to TM language to know you know nothing. >>> >> >> I spent 22 years on this. I started with the Linz text >> >> When Ĥ is applied to ⟨Ĥ⟩ >> Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qy ∞ >>    or >> Ĥ.q0 ⟨Ĥ⟩ ⊢* embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ ⊢* Ĥ.qn >> >> (a) Ĥ copies its input ⟨Ĥ⟩ >> (b) Ĥ invokes embedded_H ⟨Ĥ⟩ ⟨Ĥ⟩ >> (c) embedded_H simulates ⟨Ĥ⟩ ⟨Ĥ⟩ ... >> >> Thus ⟨Ĥ⟩ ⟨Ĥ⟩ correctly simulated by embedded_H >> cannot possibly reach its simulated final halt state >> ⟨Ĥ.qn⟩ >> >>> To refute the HP, you need to understand what it exactly means in TM. >> >> I have known this for 22 years. > > A working TM. Build it explicitly from transition function, then explain > your derivation. You know nothing. > That would be like examining how an operating system works entirely from its machine code. We only have to actually know one detail: Every counter-example input encoded in any model of computation always specifies recursive simulation that never halts to its corresponding simulating termination analyzer. -- Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius hits a target no one else can see." Arthur Schopenhauer