Re: How the requirements that Professor Sipser agreed to are exactly met --- WDH

On 5/12/25 10:53 PM, olcott wrote:

On 5/12/2025 8:27 PM, Richard Damon wrote:

On 5/12/25 2:17 PM, olcott wrote:

Introduction to the Theory of Computation 3rd Edition
by Michael Sipser (Author)
4.4 out of 5 stars    568 rating
>
https://www.amazon.com/Introduction-Theory-Computation-Michael- Sipser/ dp/113318779X
>
int DD()
  {
   int Halt_Status = HHH(DD);
   if (Halt_Status)
     HERE: goto HERE;
   return Halt_Status;
  }
>
DD correctly simulated by any pure simulator
named HHH cannot possibly terminate thus proving
that this criteria has been met:
>
<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 words 10/13/2022>
>

>
Which your H doesn't do, as it can not correctly determine what doesn't happen.
>

 Any C programmer can correctly tell what doesn't happen.
What doesn't happen is DD reaching its "return" statement
final halt state.
 

Sure they can, since that is the truth, as explained.
Since your "logic" is based on lies and equivocation, yours is the one that is wrong. The fact that you only answer is a appeal to an authorithy, that hasn't even spoken on the question.
All that shows is how utterly bad your logic is as you can't even correctly use a fallacy to try to show your claims.