Path: ...!news.snarked.org!3.eu.feeder.erje.net!2.eu.feeder.erje.net!feeder.erje.net!news.nk.ca!rocksolid2!i2pn2.org!.POSTED!not-for-mail
From: Richard Damon <richard@damon-family.org>
Newsgroups: comp.theory
Subject: Re: HHH(DD) --- COMPUTE ACTUAL MAPPING FROM INPUT TO OUTPUT --- Using
 Finite String Transformations
Date: Wed, 23 Apr 2025 18:38:58 -0400
Organization: i2pn2 (i2pn.org)
Message-ID: <debf61608ff88f8e0c73ee9a647192cd6dd1a141@i2pn2.org>
References: <vsnchj$23nrb$2@dont-email.me> <vto4vh$23i07$1@dont-email.me>
 <vto7qu$267in$1@dont-email.me> <k%RLP.1232047$Xb1.539402@fx05.ams4>
 <vtorpb$2uac$1@news.muc.de> <vtp32o$2vb5o$1@dont-email.me>
 <vtqpt5$17ns$1@news.muc.de> <vtrhbc$16pbv$2@dont-email.me>
 <vtrk7l$t44$1@news.muc.de> <vtrmfa$1be3n$1@dont-email.me>
 <vtvkgo$vjvi$1@dont-email.me> <vu2042$34l74$1@dont-email.me>
 <vu519u$1s5f9$1@dont-email.me> <vu6aha$2vn05$3@dont-email.me>
 <vu6dk4$2fq2$1@news.muc.de> <vu6knm$394oo$1@dont-email.me>
 <vu8cgm$2p5e$1@news.muc.de> <vu8gml$v0qa$2@dont-email.me>
 <vu8m2h$vn9b$2@dont-email.me> <vu8pr1$13jl5$8@dont-email.me>
 <vu8qo3$vn9b$4@dont-email.me> <vu8ruc$13jl5$12@dont-email.me>
 <vuaaae$2lbp9$2@dont-email.me> <vual1d$31aen$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Wed, 23 Apr 2025 22:40:36 -0000 (UTC)
Injection-Info: i2pn2.org;
	logging-data="1603571"; mail-complaints-to="usenet@i2pn2.org";
	posting-account="diqKR1lalukngNWEqoq9/uFtbkm5U+w3w6FQ0yesrXg";
User-Agent: Mozilla Thunderbird
X-Spam-Checker-Version: SpamAssassin 4.0.0
In-Reply-To: <vual1d$31aen$1@dont-email.me>
Content-Language: en-US
Bytes: 5042
Lines: 74

On 4/23/25 8:05 AM, olcott wrote:
> On 4/23/2025 4:02 AM, Fred. Zwarts wrote:
>> Op 22.apr.2025 om 21:50 schreef olcott:
>>> On 4/22/2025 2:30 PM, Fred. Zwarts wrote:
>>>> Op 22.apr.2025 om 21:14 schreef olcott:
>>>>> On 4/22/2025 1:10 PM, Fred. Zwarts wrote:
>>>>>> Op 22.apr.2025 om 18:38 schreef olcott:
>>>>>>>
>>>>>>> a function is computable if there exists an algorithm
>>>>>>> that can do the job of the function, i.e. given an input
>>>>>>> of the function domain it can return the corresponding output.
>>>>>>> https://en.wikipedia.org/wiki/Computable_function
>>>>>>>
>>>>>>> On Turing Machines inputs <are> finite strings, and
>>>>>>> finite string transformation rules <are> applied to
>>>>>>> these finite strings to derive corresponding outputs.
>>>>>>>
>>>>>> And it has been proven that no finite string transformations are 
>>>>>> possible that report the halting behaviour for all inputs that 
>>>>>> specify a correct program. 
>>>>>
>>>>> int sum(int x, int y) { return x + y; }
>>>>> Only when people stupid assume the same thing as
>>>>> sum(3,2) should return the sum of 5 + 3.
>>>>>
>>>> Therefore HHH should report on the actual input, the finite string 
>>>> that describes a halting program. Not on the hypothetical input that 
>>>> does not halt, because it is based on a hypothetical HHH that does 
>>>> not abort.
>>>>
>>>> Why do you maintain that HHH should process the hypothetical input 
>>>> instead of the actual input.
>>>> Do you really believe that 3+2 equals 5+3?
>>>
>>> I have proven that the directly executed DD and DD
>>> emulated by HHH according to the semantics of the
>>> x86 language have a different set of state changes
>>> many hundreds of times for several years.
>> You never showed a proof. You only repeated a dream. You are dreaming 
>> many years without any logic. You failed to show the first state 
>> change where the direct execution is different from the simulation. 
>> You only showed an erroneous HHH that fails to reach the end of the 
>> simulation of a halting program.
> 
> I have showed this hundreds of times.
> 
>   _DD()
> [00002133] 55         push ebp      ; housekeeping
> [00002134] 8bec       mov ebp,esp   ; housekeeping
> [00002136] 51         push ecx      ; make space for local
> [00002137] 6833210000 push 00002133 ; push DD
> [0000213c] e882f4ffff call 000015c3 ; call HHH(DD)
> [00002141] 83c404     add esp,+04
> [00002144] 8945fc     mov [ebp-04],eax
> [00002147] 837dfc00   cmp dword [ebp-04],+00
> [0000214b] 7402       jz 0000214f
> [0000214d] ebfe       jmp 0000214d
> [0000214f] 8b45fc     mov eax,[ebp-04]
> [00002152] 8be5       mov esp,ebp
> [00002154] 5d         pop ebp
> [00002155] c3         ret
> Size in bytes:(0035) [00002155]
> 
> Anyone that is an expert on the x86 language can directly
> see that DD emulated by HHH cannot possibly reach its final
> halt state by the finite string transformation rules of the
> x86 language.
> 
> Liars and ignorant people may disagree.
> 

Which isn't a "Program" and thus can't be emulated by a pure program, 
and thus doesn't have behavior.

You just don't understand what you are talking about.