Deutsch   English   Français   Italiano  
<68cde477cc9e792bb180144ca01490c2d7b225d5@i2pn2.org>

View for Bookmarking (what is this?)
Look up another Usenet article

Path: news.eternal-september.org!eternal-september.org!feeder3.eternal-september.org!i2pn.org!i2pn2.org!.POSTED!not-for-mail
From: Richard Damon <richard@damon-family.org>
Newsgroups: comp.theory
Subject: Re: Turing Machine computable functions apply finite string
 transformations to inputs VERIFIED FACT
Date: Wed, 30 Apr 2025 19:28:09 -0400
Organization: i2pn2 (i2pn.org)
Message-ID: <68cde477cc9e792bb180144ca01490c2d7b225d5@i2pn2.org>
References: <vu6lnf$39fls$2@dont-email.me> <vujfuu$35hcg$1@dont-email.me>
 <65dddfad4c862e6593392eaf27876759b1ed0e69@i2pn2.org>
 <vujlj0$3a526$1@dont-email.me> <vujln7$32om9$8@dont-email.me>
 <vujmmm$3a526$2@dont-email.me> <vujmrj$32om9$9@dont-email.me>
 <vujtcb$3gsgr$1@dont-email.me> <vuju44$3hnda$1@dont-email.me>
 <vuk47o$3qkbb$1@dont-email.me> <vuk6b6$3l184$1@dont-email.me>
 <vuls34$1bf1j$4@dont-email.me> <vun87k$2m24h$2@dont-email.me>
 <vunb06$2fjjl$5@dont-email.me> <vuo57j$3h5l9$2@dont-email.me>
 <vuoath$3ljma$1@dont-email.me> <vuohgi$3td7u$1@dont-email.me>
 <vuonh6$2g74$2@dont-email.me> <vupeor$qf60$1@dont-email.me>
 <vupu0r$18vrc$1@dont-email.me> <vuqj5u$1rljg$1@dont-email.me>
 <vuql8e$1svmd$1@dont-email.me> <vur7vd$2dvvs$1@dont-email.me>
 <vur9t9$2gjif$1@dont-email.me> <vurasr$2hkih$1@dont-email.me>
 <vurbgd$2gjif$2@dont-email.me> <vurgt8$2n355$1@dont-email.me>
 <vuric8$2gjif$3@dont-email.me> <vutepm$gmbi$4@dont-email.me>
 <vutgjt$hkal$3@dont-email.me> <vutmka$nvbg$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Wed, 30 Apr 2025 23:55:57 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="2600536"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
Content-Language: en-US
X-Spam-Checker-Version: SpamAssassin 4.0.0
In-Reply-To: <vutmka$nvbg$1@dont-email.me>

On 4/30/25 1:28 PM, olcott wrote:
> On 4/30/2025 10:46 AM, Richard Heathfield wrote:
>> On 30/04/2025 16:15, olcott wrote:
>>> On 4/29/2025 5:03 PM, Richard Heathfield wrote:
>>>> On 29/04/2025 22:38, olcott wrote:
>>>>
>>>> <snip>
>>>>
>>>>>
>>>>> int DD()
>>>>> {
>>>>>    int Halt_Status = HHH(DD);
>>>>>    if (Halt_Status)
>>>>>      HERE: goto HERE;
>>>>>    return Halt_Status;
>>>>> }
>>>>>
>>>>> HHH is correct DD as non-halting BECAUSE THAT IS
>>>>> WHAT THE INPUT TO HHH(DD) SPECIFIES.
>>>>
>>>> You're going round the same loop again.
>>>>
>>>> Either your HHH() is a universal termination analyser or it isn't. 
>>>
>>> The domain of HHH is DD.
>>
>> Then it is attacking not the Halting Problem but the Olcott Problem, 
>> which is of interest to nobody but you.
>>
> 
> Because you don't pay any attention at all
> you did not bother to notice that I have never been
> attacking the Halting Problem only the conventional
> Halting Problem proof.
> 
> THE IMPOSSIBLE INPUT IS REJECTED AS NON-HALTING.
> 

Only by LYING and using strawman.

You are just proving your stupidity.