Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!eternal-september.org!.POSTED!not-for-mail
From: olcott <polcott333@gmail.com>
Newsgroups: comp.theory
Subject: Re: Incorrect requirements --- Computing the mapping from the input
 to HHH(DD)
Date: Sun, 11 May 2025 21:11:10 -0500
Organization: A noiseless patient Spider
Lines: 72
Message-ID: <vvrlbv$o2ab$7@dont-email.me>
References: <vv97ft$3fg66$1@dont-email.me>
 <87msbmeo3b.fsf@nosuchdomain.example.com> <vvjcge$27753$2@dont-email.me>
 <vvjeqf$28555$1@dont-email.me> <vvjffg$28g5i$1@dont-email.me>
 <875xiaejzg.fsf@nosuchdomain.example.com> <vvjgt1$28g5i$5@dont-email.me>
 <87jz6qczja.fsf@nosuchdomain.example.com> <vvjotc$28g5i$12@dont-email.me>
 <vvnh9u$3hd96$1@raubtier-asyl.eternal-september.org>
 <vvno4e$3in62$2@dont-email.me> <vvo71c$rlt$1@news.muc.de>
 <PlNTP.270466$lZjd.128570@fx05.ams4> <vvochv$15td$2@news.muc.de>
 <vvodn5$3na6l$3@dont-email.me>
 <1276edeb9893085c59b02bbbd59fe2c64011736b@i2pn2.org>
 <vvqk4s$gldn$12@dont-email.me> <vvqln4$g8ck$5@dont-email.me>
 <vvrftj$ndkg$1@dont-email.me> <vvrggs$n9a9$3@dont-email.me>
 <vvrh3k$mv2a$3@dont-email.me> <vvrhg1$nljf$1@dont-email.me>
 <45a66b0ed6199db17ea1f5f8e980fd696182ec7d@i2pn2.org>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Mon, 12 May 2025 04:11:11 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="15cac720ddbb61c7f6586fe023932af8";
	logging-data="788811"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX180TzpFBWZsnS+BOk/tqHFy"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:rgXcx3NHMPGe0uBTsXLUMH8nd8o=
In-Reply-To: <45a66b0ed6199db17ea1f5f8e980fd696182ec7d@i2pn2.org>
X-Antivirus: Norton (VPS 250511-4, 5/11/2025), Outbound message
X-Antivirus-Status: Clean
Content-Language: en-US
Bytes: 4851

On 5/11/2025 8:40 PM, Richard Damon wrote:
> On 5/11/25 9:05 PM, olcott wrote:
>> On 5/11/2025 7:58 PM, dbush wrote:
>>> On 5/11/2025 8:48 PM, olcott wrote:
>>>> On 5/11/2025 7:38 PM, Mike Terry wrote:
>>>>> On 11/05/2025 18:11, Richard Heathfield wrote:
>>>>>> On 11/05/2025 17:44, olcott wrote:
>>>>>>> Any yes/no question where both yes and no are the
>>>>>>> wrong answer is an incorrect polar question.
>>>>>>
>>>>>> Either DD stops or it doesn't (once it's been hacked around to get 
>>>>>> it to compile and after we've leeched out all the dodgy programming).
>>>>>
>>>>> Done that.  It still stops.
>>>>>
>>>>>>
>>>>>> If the computer cannot correctly decide whether or not DD halts, 
>>>>>
>>>>> The decider says it doesn't stop..
>>>>>
>>>>>> we have an undecidable computation, 
>>>>>
>>>>> No no, that doesn't make sense.  DD stops, and there are lots of 
>>>>> partial halt deciders that will decide that particular input 
>>>>> correctly.  PO's DD isn't "undecidable".
>>>>>
>>>>> No single computation can be undecidable, considered on its own! 
>>>>> There are only two possibilities: it halts or it doesn't.  In 
>>>>> either case there is a decider which decides that /one specific 
>>>>> input/ correctly. By extension, any finite number of computations 
>>>>> is decidable - we just have a giant switch statement followed by 
>>>>> returning halts/neverhalts as appropriate.  If the input domain has 
>>>>> just n inputs, there are 2^n trivial deciders that together cater 
>>>>> for every combination of each input halting or never halting.  One 
>>>>> of those deciders is a correct decider for that (finite domain) 
>>>>> problem.
>>>>>
>>>>> The HP is asking for a TM (or equiv.) that correctly decides EVERY 
>>>>> (P,I) in its one finite algorithm.  That is what is proven 
>>>>> impossible.  The trick of having a big switch statement no longer 
>>>>> works because there are infinitely many possible inputs.
>>>>>
>>>>> Decidability for just one single input is trivial and not intersting.
>>>>>
>>>>>> and therefore some computations are undecidable, so Turing's 
>>>>>> conclusion was right. Who knew? (Apart from practically everybody 
>>>>>> else, I mean.)
>>>>>
>>>>>
>>>>> Mike.
>>>>
>>>> DDD emulated by HHH according to the rules of
>>>> the computational language that DD is encoded
>>>> within 
>>>
>>> Doesn't happen, as you have admitted on the record:
>>>
>>>
>>
>> I admitted on record that DDD is not infinitely
>> emulated by HHH. Because you are only a damned
>> Troll you try to twist this into incorrect emulation.
>>
> 
> Then why is the emulation of it non-halting? 

You will never know because you have no idea
what infinite recursion is.

-- 
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer