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

Liste des GroupesRevenir à s logic 
Sujet : Re: How the requirements that Professor Sipser agreed to are exactly met --- WDH
De : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theory
Date : 13. May 2025, 05:52:36
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <vvuj6l$1j6s0$3@dont-email.me>
References : 1 2 3 4
User-Agent : Mozilla Thunderbird
On 5/12/2025 11:05 PM, Richard Damon wrote:
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,
If my logic was based on lies and equivocation
then you could provide actual reasoning that
corrects my errors.
It is truism that simulating termination analyzers
must report on the behavior of their input as if
they themselves never aborted this simulation:
*simulated D would never stop running unless aborted*
or they themselves could become non-terminating.
A rebuttal must take the form of another criteria
that prevents the simulating termination analyzer
from becoming non-terminating.
The lame rebuttals that I have been getting are
all of the form: "that is not the way that I memorized it."
--
Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer

Date Sujet#  Auteur
26 May 25 o 

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal