Re: Halting Problem is wrong two different ways

On 2024-06-07 14:09:54 +0000, olcott said:

On 6/7/2024 1:22 AM, Mikko wrote:

On 2024-06-06 15:18:21 +0000, olcott said:

 *Here is that problem statement*
Prove that sum(3,4) is incorrect on the basis that
sum(3,4) cannot and does not provide the sum of 5 + 6.

 That problem statement does not restrict what another
problem statement may specify.
 

 It is an analogy.

It is not analogous to anything relevant, nor was it presented
as a relevant or other analog.

All halt deciders are only allowed to report on the actual
behavior of their actual input.

That does not restrict what a problem statement may specify.

I have proven right here that the actual behavior of the actual
input is that it remains stuck in recursive simulation.

That does not restrict what a problem statement may specify.

Try any show how this DD can be correctly simulated by any HH
such that this DD reaches past its machine address [00001dbe]

Not now as, whether DD reaches past 00001dbe or not, that does
not restrict what a problem statement may specify.

_DD()
[00001e12] 55         push ebp
[00001e13] 8bec       mov  ebp,esp
[00001e15] 51         push ecx
[00001e16] 8b4508     mov  eax,[ebp+08]
[00001e19] 50         push eax      ; push DD
[00001e1a] 8b4d08     mov  ecx,[ebp+08]
[00001e1d] 51         push ecx      ; push DD
[00001e1e] e85ff5ffff call 00001382 ; call HH
 I proved that I am correct and no one even looks
at this proof, that is NOT AN HONEST DIALOGUE.

You haven't, but even if you had that would not restrict
what a problem statement may specify.

The above proof proves that DD is correctly simulated by HH
and DD simulated by HH DOES MEET the Sipser approve criteria.

That does not restrict what a problem statement may specify.

<MIT Professor Sipser agreed to ONLY these verbatim words 10/13/2022>
   If simulating halt decider H correctly simulates its input D
   until H correctly determines that its simulated D would never
   stop running unless aborted then
    H can abort its simulation of D and correctly report that D
   specifies a non-halting sequence of configurations.
</MIT Professor Sipser agreed to ONLY these verbatim words10/13/2022>

That does not restrict what a problem statement may specify.

Professor Sipser <is> the author of the best selling theory of
computation textbook.
 *Introduction to the Theory of Computation, by Michael Sipser*
https://www.amazon.com/Introduction-Theory-Computation-Michael-Sipser/dp/113318779X/ 

That book does not restrict what a problem statement may specify.
But the book might be worth reading anyway.
--
Mikko