Re: Formal systems that cannot possibly be incomplete except for unknowns and unknowable

On 5/7/2025 8:30 PM, dbush wrote:

On 5/7/2025 9:20 PM, olcott wrote:

On 5/7/2025 7:44 PM, dbush wrote:

On 5/7/2025 8:19 PM, olcott wrote:

On 5/7/2025 7:15 PM, dbush wrote:

On 5/7/2025 7:40 PM, olcott wrote:

On 5/7/2025 6:31 PM, dbush wrote:

On 5/7/2025 7:26 PM, olcott wrote:

>
When N instructions of DD are emulated by HHH
according to the rules of the x86 language then

>
The subject was "DD emulated by HHH", not "N instructions of DD emulated by HHH".
>
Changing the subject is the dishonest dodge of the strawman deception.

>
>
That you and Richard construe anything less than an
infinite number of steps of DD emulated by HHH
(according to the rules of the x86 language)
as an incorrect emulation IS MORONICALLY STUPID.
>

>
The fixed immutable code of HHH simulates a fixed number X of instructions of DD, the last of which was simulated incorrectly. Any number other than X is not what HHH simulates and is therefore irrelevant to HHH.
>
UTM simulates X+Y instruction of DD correctly and reaches a final state.
>

>
I will make it easier to understand.
>
void DDD()
{
   HHH(DDD);
   return;
}
>
Can DDD simulated by HHH reach its own "return" instruction?
>

>
Category error. There is no "can" as algorithm HHH is fixed and immutable, as is algorithm DDD.
>

>
Does there exist an HHH

 Category error.  There is only one algorithm HHH and one algorithm DDD.
 

such that DDD emulated by
HHH according to the rules of the C programming language
where the DDD element of the infinite set of HHH/DDD
pairs reaches its own "return" instruction?

 Changing the input is not allowed.
 

>
It is like I am asking you is there a positive
number that is less than zero? You don't have
to check the positive numbers one-at-a-time.
>
We can know with complete certainty that no DDD
simulated by any HHH can possibly reach its own
"return" instruction.

 Changing the input is not allowed.
 

>

Algorithm HHH *does not* simulate algorithm DDD to the end but instead aborts in violation of the x86 language.
>

>
there is no end to reach.

 False.  See below.
 

>

Algorithm UTM *does* simulate algorithm DDD to the end.

DDD emulated by HHH according to the rules of the
x86 language has an easily provably different sequence
of steps than directly executed DDD() according to the
rules of the x86 machine language.
--
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer