Re: HHH maps its input to the behavior specified by it --- never reaches its halt state ---

On 8/10/2024 8:08 AM, Fred. Zwarts wrote:

Op 10.aug.2024 om 13:34 schreef olcott:

On 8/10/2024 3:27 AM, Fred. Zwarts wrote:

Op 09.aug.2024 om 22:53 schreef olcott:

On 8/9/2024 2:35 PM, Fred. Zwarts wrote:

Op 09.aug.2024 om 18:19 schreef olcott:

>
void DDD()
{
   HHH(DDD);
   return;
}
>
Each HHH of every HHH that can possibly exist definitely
emulates zero to infinity instructions of DDD correctly.
Every expert in the C language sees that this emulated DDD
cannot possibly reaches its own "return" instruction halt state.

And you don't need to be an expert to see that this proves that all these simulations are incorrect.

>
In other words you are trying to get away with the lie that
Richard has been persistently pushing:
>
When N > 0 instructions of DDD are correctly emulated by HHH
then no instructions of DDD have been correctly emulated.
>

  In other words, you believe that only the numbers zero and infinite exist.
 

*The set of HHH x86 emulators are defined such that*
Each element of this set corresponds to one element of
the set of positive integers indicating the number of
x86 instructions of DDD that it correctly emulates.
When we can see that in none of these cases that the
correctly emulated DDD ever reaches its "return" instruction
halt state.
This entails that each HHH can take a wild guess that
its input does not reach this halt state and HHH would
necessarily be correct.
When all X has property Y then each X is necessarily
correct to state that is has property Y.
--
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer