Re: DDD correctly emulated by HHH is correctly rejected as non-halting. --- You are not paying attention

On 2024-07-15 13:32:27 +0000, olcott said:

On 7/15/2024 2:57 AM, Mikko wrote:

On 2024-07-14 14:48:05 +0000, olcott said:
 

On 7/14/2024 3:49 AM, Mikko wrote:

On 2024-07-13 12:18:27 +0000, olcott said:

 When the source of your disagreement is your own ignorance
then your disagreement has no actual basis.
 *You can comprehend this is a truism or fail to*
*comprehend it disagreement is necessarily incorrect*
Any input that must be aborted to prevent the non
termination of HHH necessarily specifies non-halting
behavior or it would never need to be aborted.
 Disagreeing with the above is analogous to disagreeing
with arithmetic.

 A lame analogy. A better one is: 2 + 3 = 5 is a proven theorem just
like the uncomputability of halting is.

 The uncomputability of halting is only proven when the problem
is framed this way: HHH is required to report on the behavior
of an input that was defined to do exactly the opposite of
whatever DDD reports.

No, it is proven about the halting problem as that problem is.
The program that predicts what HHH would say and does the opposite
is just one eample of a program.

When HHH is defined such that an input that was defined to
do the opposite of whatever HHH reports can never reach this
point in its execution trace then the prior halting problem
proof has been defeated.

No, not anymore that 2 + 3 = 5 is defeated by a 2 that is defined to
shrink to 1 if 3 is added to it.
--
Mikko