Deutsch   English   Français   Italiano  
<vugucr$pke9$5@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!eternal-september.org!.POSTED!not-for-mail
From: olcott <polcott333@gmail.com>
Newsgroups: comp.theory
Subject: Re: Computable Functions --- finite string transformation rules
Date: Fri, 25 Apr 2025 16:21:30 -0500
Organization: A noiseless patient Spider
Lines: 62
Message-ID: <vugucr$pke9$5@dont-email.me>
References: <vsnchj$23nrb$2@dont-email.me> <vtkkge$2si58$2@dont-email.me>
 <vtl56j$3aajg$1@dont-email.me> <vtlu0a$3vgp0$1@dont-email.me>
 <vtm04f$2a90$1@dont-email.me> <vtm9q8$aut7$1@dont-email.me>
 <vtmah8$2a90$2@dont-email.me> <vtmgen$gs48$1@dont-email.me>
 <c2ad5086dba36124c070173c3e3252967df2fab9@i2pn2.org>
 <vu8g3q$v0qa$1@dont-email.me> <vu8lse$vn9b$1@dont-email.me>
 <vu8og4$13jl5$7@dont-email.me>
 <6d9ae3ac08bbbe4407fc3612441fc2032f949a3d@i2pn2.org>
 <vub168$3clpn$2@dont-email.me>
 <7ac75991b443ba53d52960ddb1932524dea8e03f@i2pn2.org>
 <40b048f71fe2ed2a8ef11d2d587c765c8fcbc977@i2pn2.org>
 <vucrgq$148pf$1@dont-email.me> <vudkt8$1ona3$2@dont-email.me>
 <vudp39$1rhdn$1@dont-email.me> <vudrgb$20gck$1@dont-email.me>
 <vue2fb$27hl3$1@dont-email.me> <vue464$28iho$2@dont-email.me>
 <vue57b$27hl3$3@dont-email.me> <vue8qm$2d7t8$1@dont-email.me>
 <cb382175aa6cc9a806dedc1d2bcfbd916dfaf1b5@i2pn2.org>
 <vuejgn$2md4c$3@dont-email.me>
 <ae8fce7ec0639d76c87bf1af0dfbc2a806053899@i2pn2.org>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Fri, 25 Apr 2025 23:21:31 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="cda93a9fcc5460bc8f96c9b00569a78d";
	logging-data="840137"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX18R9+/TeHlYc7/NQ5hOKlTS"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:EgWe+RV7KT07AeijrUYCUHHaQ8M=
X-Antivirus-Status: Clean
Content-Language: en-US
X-Antivirus: Norton (VPS 250425-6, 4/25/2025), Outbound message
In-Reply-To: <ae8fce7ec0639d76c87bf1af0dfbc2a806053899@i2pn2.org>
Bytes: 4758

On 4/25/2025 8:56 AM, joes wrote:
> Am Thu, 24 Apr 2025 19:03:34 -0500 schrieb olcott:
>> On 4/24/2025 6:10 PM, Richard Damon wrote:
>>> On 4/24/25 5:01 PM, olcott wrote:
>>>> On 4/24/2025 2:59 PM, Fred. Zwarts wrote:
>>>>> Op 24.apr.2025 om 21:41 schreef olcott:
>>>>>> On 4/24/2025 2:12 PM, Fred. Zwarts wrote:
>>>>>>> Op 24.apr.2025 om 19:13 schreef olcott:
>>>>>>>>
>>>>>>>> HHH correctly determines through mathematical induction that DD
>>>>>>>> emulated by HHH (according to the finite string transformations
>>>>>>>> specified by the x86 language) cannot possibly reach its final
>>>>>>>> halt state in an infinite number of steps.
>>>>>>
>>>>>>> No, HHH has a bug which makes that it fails to see that there is
>>>>>>> only a finite recursion,
>>>>>>
>>>>>> When the finite string transformation rules of the x86 language are
>>>>>> applied to the input to HHH(DD)
>>>>>> THIS DD CANNOT POSSIBLY REACH ITS FINAL HALT STATE not even after an
>>>>>> infinite number of emulated steps.
>>>>>>
>>>>> Again a lot of text, but no rebuttal.
> 
>>>> When the finite string transformation rules of the x86 language are
>>>> applied to the input to HHH(DD)
>>>> THIS DD CANNOT POSSIBLY REACH ITS FINAL HALT STATE not even after an
>>>> infinite number of emulated steps.
>>>>
>>> No, HHH just stops performing those before it get to the end.
>>> The transformation, which by definition of the x86 language, don't just
>>> stop in the middle, continue to the point where the emulated HHH aborts
>>> its emulation and returns 0 to the emulated DD which the halts.
>>
>> Mathematical induction proves that DD emulated by HHH cannot possibly
>> reach its own final state in an infinite number of steps and it does
>> this with one recursive emulation.
>> There is a repeating pattern that every C programmer can see.

> Like Fred wrote months ago, that has nothing to do with the contradictory
> part of DD, 

Sure it does. The contradictory part of DD has always
been unreachable thus only a ruse.

> only with it being simulated by the same simulator it calls.

That <is> the Halting Problem counter-example input.

> The program EE(){ HHH(EE); } also halts and cannot be simulated by HHH.
> 

HHH cannot possibly do this without violating the rules of
the x86 language.

The finite string transformation rules of the x86 language
applied to the input to HHH(DD) only correctly derive not halting.
*It is like you are trying to get away with disagreeing with arithmetic*

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