Re: Who here understands that the last paragraph is Necessarily true?

On 7/15/2024 6:09 AM, Richard Damon wrote:

On 7/14/24 11:41 PM, olcott wrote:

On 7/14/2024 9:04 PM, Richard Damon wrote:

On 7/14/24 9:27 PM, olcott wrote:

>
Any input that must be aborted to prevent the non termination
of simulating termination analyzer HHH necessarily specifies
non-halting behavior or it would never need to be aborted.

>
Excpet, as I have shown, it doesn't.
>
Your problem is you keep on ILEGALLY changing the input in your argument because you have misdefined what the input is.
>
The input to HHH is ALL of the memory that it would be accessed in a correct simulation of DDD, which includes all the codd of HHH, and thus, if you change HHH you get a different input.
>
If you want to try to claim the input is just the bytes of the function DDD proper then you are just admitting that you are nothing more than a lying idiot that doesn't understand the problem,

Turing machines only operate on finite strings they do
not operate on other Turing machines *dumbo*
>

 But they can operate on REPRESENTATIONS of Turing Machines,

The actual finite string of DDD correctly emulated by HHH according
to the semantics of the x86 language does map to the behavior that
DDD specifies and does not map to the behavior that you falsely assume.
--
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer