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: DDD correctly emulated by HHH --- Correct Emulation Defined
Date: Thu, 20 Mar 2025 20:48:22 -0500
Organization: A noiseless patient Spider
Lines: 81
Message-ID: <vrigh6$f35v$1@dont-email.me>
References: <vrfuob$256og$1@dont-email.me> <vrgme1$2tr56$1@dont-email.me>
 <vri5mn$6nv4$1@dont-email.me>
 <8354fe5751e03a767452a3999818d5c6da714a6b@i2pn2.org>
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8; format=flowed
Content-Transfer-Encoding: 8bit
Injection-Date: Fri, 21 Mar 2025 02:48:23 +0100 (CET)
Injection-Info: dont-email.me; posting-host="a8bcb60c261ac82b4e65e3f0777024ca";
	logging-data="494783"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1/vvxw9MvQIqPBAocHiUqUi"
User-Agent: Mozilla Thunderbird
Cancel-Lock: sha1:63MR9AaGqDUrzMjJl9ToGI7HEGA=
X-Antivirus-Status: Clean
X-Antivirus: Norton (VPS 250320-10, 3/20/2025), Outbound message
Content-Language: en-US
In-Reply-To: <8354fe5751e03a767452a3999818d5c6da714a6b@i2pn2.org>
Bytes: 3999

On 3/20/2025 8:31 PM, Richard Damon wrote:
> On 3/20/25 6:43 PM, olcott wrote:
>> On 3/20/2025 4:16 AM, Mikko wrote:
>>> On 2025-03-20 02:32:43 +0000, olcott said:
>>>
>>>> DDD()
>>>> [00002172] 55         push ebp      ; housekeeping
>>>> [00002173] 8bec       mov  ebp,esp  ; housekeeping
>>>> [00002175] 6872210000 push 00002172 ; push DDD
>>>> [0000217a] e853f4ffff call 000015d2 ; call HHH(DDD)
>>>> [0000217f] 83c404     add  esp,+04
>>>> [00002182] 5d         pop  ebp
>>>> [00002183] c3         ret
>>>> Size in bytes:(0018) [00002183]
>>>>
>>>> When N steps of DDD are emulated by HHH according
>>>> to the semantics of the x86 language then these
>>>> N steps are emulated correctly.
>>>
>>> That does not make much sense to define the correct emulation of DDD as
>>> it should mean whatever "correct emulation" means when applied to DDD.
>>>
>>> Althouth promised otherwise on the subject line the meaning of "DDD
>>> correctly emulated by HHH" when N is not specified is not defined.
>>>
>>
>> N in this context always means any element of the
>> set of natural numbers.
> 
> Then HHH isn't a specific program, and you are admitting that you 
> "logic" is just based on FRAUD.
> 

We have been over this same thing too many times.

>>
>> 1,2,3...4,294,967,296 steps of DDD are correctly emulated
>> by HHH and DDD never reaches its "ret" instruction and
>> terminates normally.
> 
> DIFFERENT HHHs and thus DIFFERENT DDDs were emulated.
> 

The point remains the same without the additional details.
For every HHH at machine address 000015d2 when the above
listed machine code is emulated for any finite number of
steps according to the semantics of the x86 language the
above finite string of machine code never reaches its own
"ret" instruction and halts.

>>
>>> The term should be or include "partial emulation" when the intent is
>>> that an emulation that could be continued is not is called "correct".
>>>
>>
>> A finite number of N steps means a finite emulation.
>>
> 
> Right, and every one of them creates an input DDD, 

Same finite string at the same machine address 00002172.

> that when COMPLETELY 
> emulated halts,

You already said that DDD emulated by HHH never reaches
its own "ret" instruction in any finite number of steps,
WHY LIE ABOUT THIS NOW?

> and thus should be called a halting input in any HONEST 
> logic system.
> 
WHY LIE ABOUT THIS NOW?

> Of course, in your FRAUD, you claim otherwise, but that just shows how 
> bad your FRAUDULANT system is,


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