Re: Mike Terry Proves --- How the requirements that Professor Sipser agreed to are exactly met

Liste des GroupesRevenir à theory 
Sujet : Re: Mike Terry Proves --- How the requirements that Professor Sipser agreed to are exactly met
De : news.dead.person.stones (at) *nospam* darjeeling.plus.com (Mike Terry)
Groupes : comp.theory
Date : 18. May 2025, 16:21:49
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <100ctuc$121rs$1@dont-email.me>
References : 1 2 3 4 5 6 7 8
User-Agent : Mozilla/5.0 (Windows NT 10.0; Win64; x64; rv:91.0) Gecko/20100101 Firefox/91.0 SeaMonkey/2.53.18.2
On 18/05/2025 10:09, Mikko wrote:
On 2025-05-17 17:15:14 +0000, olcott said:
 
On 5/17/2025 5:06 AM, Mikko wrote:
On 2025-05-16 15:07:03 +0000, olcott said:
>
On 5/16/2025 2:13 AM, Mikko wrote:
On 2025-05-15 23:43:27 +0000, olcott said:
>
On 5/15/2025 6:18 PM, Richard Damon wrote:
On 5/15/25 4:47 PM, olcott wrote:
I overcome the proof of undecidability of the Halting
Problem in that the code that
"does the opposite of whatever value that HHH returns"
becomes unreachable to DD correctly simulated by HHH.
>
Nope, only to youtr INCORRECTLY simuated by HHH.
>
>
In other words you believe that professor Sipser
screwed up when he agreed with these exact words.
>
<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>
>
One may indeed thik so. Or pehaps he knew what he was doing but cheated.
To sincerely agree with you without extreme care is an error.
>
On 5/14/2025 7:36 PM, Mike Terry wrote:
 > There is a natural (and correct) statement that Sipser
 > is far more likely (I'd say) to have agreed to.
>
That is compatible with the idea that Sipser scewed up or cheated.
>
 > First you should understand the basic idea behind a
 > "Simulating Halt Decider" (*SHD*) that /partially/
 > simulates its input, while observing each simulation
 > step looking for certain halting/non-halting patterns
 > in the simulation. A simple (working) example here
 > is an input which goes into a tight loop.
(Mike says much more about this)
>
*Click here to get the whole article*
https://al.howardknight.net/? STYPE=msgid&MSGI=%3C1003cu5%242p3g1%241%40dont-email.me%3E
>
Message-ID: <1003cu5$2p3g1$1@dont-email.me>
>
There he explains an error in your claim to meet the requirements that
Professor Sipser agreed.
>
He also shows that your "In other words you believe that professor
Sipser screwed up when he agreed with these exact words" is not
supported by evidence (but that is quite obvious anyway).
>
>
*That is fully addressed in my reply to Mike*
On 5/17/2025 10:31 AM, olcott wrote:
[How the requirements that Professor Sipser agreed to are exactly
  met --- Mike my best reviewer]
>
Message-ID: <100aa5c$f19u$1@dont-email.me>
https://al.howardknight.net/?STYPE=msgid&MSGI=%3C100aa5c%24f19u%241%40dont-email.me%3E
 That page does not show all of the message.
 You say there:
 
Mike's reviews of my work are at least ten-fold better
than the next best reviewer. Mike is one of the few
people here that really wants an honest dialogue. He
carefully examined my code and has a nearly perfect
understanding.
 Mike and I agree about everything essential in these discussion, and
I havn't noticed any disagreement is the less essential.
 Your statement "Mike is one of the few people here that really wants
an honest dialogue" is far from true. Some peole may have a stronger
desire to keep the discussion honest but there are not many who have
any reason to want any dishonest discussion. Of course everyone's
ability to keep the discussion honest is restricted to ones own
contributions.
 You also say:
 
HHH(DDD) does not base its decision on the actual
behavior of DDD after it has aborted its simulation
of DDD, instead it bases its decision on a different
HHH/DDD pair that never aborts.
 This is why HHH does not satisfy "H correctly determines that its
simulated D would never stop running unless aborted". If HHH bases
its decision on anything else than what its actual input actually
specifies it does not decide correctly.
 
Right.  It seems to be a recent innovation in PO's wording that he has started using the phrase "..bases its decision on a different *HHH/DDD pair* ..".
He used to just say something like "..on a different HHH..".  That allowed him to deceive himself into thinking that only the decider was being changed.  The fact that he has started using the wording "HHH/DDD pair" suggests he has finally twigged that he is indeed changing the input - although people were telling him that right from the beginning.
As with all his mistakes that he bumps up against, rather than analysing where he went wrong, he simply doubles down and just makes up whatever new (baseless) justifications are needed for him to maintain his delusions.  In the case of changing the input, he quietly sneaks in a couple of extra words "DDD/  *HHH pair*" as though nothing significant has changed - and the new wording means it is right to change the input because we have to maintain the HHH/DDD Linz relationship (or whatever).
His big problem here is
a) that it's OBVIOUSLY wrong to change the input.  Nobody, anywhere, is ever going to let PO get away with that, except perhaps Mr.Flibble (not sure on that one).
Then again, it is OBVIOUSLY wrong to report non-halting for a computation that halts, so PO has been here before!
b) Sipser's wording makes no mention of such a bizarre idea.  For whatever reason, PO seems to put much weight recently on what Sipser said.  (And what I said, what Ben has said and so on.)  For someone who makes a big thing about everyone else being "learned by rote" people who can't think for themselves, that has to be seen as somewhat hypocritical!  Anyway, he can't claim his favourite Sipser quote /tells/ him to change the input.
Mike.

Date Sujet#  Auteur
15 May 25 * Overcoming the proof of undecidability of the Halting Problem by a simple example in C220olcott
15 May 25 +* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C18olcott
15 May 25 i+* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C12olcott
16 May 25 ii+* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C7olcott
16 May 25 iii+* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C2olcott
16 May 25 iiii`- Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C1Richard Damon
16 May 25 iii`* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C4Mikko
16 May 25 iii `* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C3olcott
16 May 25 iii  +- Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C1Richard Damon
17 May10:27 iii  `- Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C1Mikko
16 May 25 ii`* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C4Mikko
16 May 25 ii `* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C3olcott
16 May 25 ii  +- Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C1Richard Damon
17 May10:30 ii  `- Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C1Mikko
16 May 25 i`* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C5Mikko
16 May 25 i `* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C4olcott
16 May 25 i  +- Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C1olcott
16 May 25 i  +- Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C1Richard Damon
17 May10:35 i  `- Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C1Mikko
16 May 25 `* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C201olcott
16 May 25  +* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C61Richard Heathfield
16 May 25  i`* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C60olcott
16 May 25  i +* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C3Richard Heathfield
16 May 25  i i`* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C2olcott
16 May 25  i i `- Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C1Richard Heathfield
16 May 25  i `* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C56Mikko
16 May 25  i  `* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C55olcott
16 May 25  i   +* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C29Richard Heathfield
17 May 25  i   i`* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C28olcott
17 May 25  i   i +* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C6Richard Damon
17 May 25  i   i i`* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C5olcott
17 May 25  i   i i `* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C4Richard Damon
17 May 25  i   i i  `* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C3olcott
17 May09:57  i   i i   +- Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C1Fred. Zwarts
17 May13:48  i   i i   `- Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C1Richard Damon
17 May 25  i   i `* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C21Richard Heathfield
17 May 25  i   i  `* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C20olcott
17 May 25  i   i   +* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C15Richard Heathfield
17 May 25  i   i   i`* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C14olcott
17 May 25  i   i   i `* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C13Richard Heathfield
17 May 25  i   i   i  `* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C12olcott
17 May 25  i   i   i   +* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C5Richard Heathfield
17 May 25  i   i   i   i`* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C4olcott
17 May 25  i   i   i   i `* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C3Richard Heathfield
17 May 25  i   i   i   i  `* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C2olcott
17 May 25  i   i   i   i   `- Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C1Richard Heathfield
17 May13:59  i   i   i   `* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C6Richard Damon
18 May12:09  i   i   i    `* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C5Richard Heathfield
19 May10:23  i   i   i     `* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C4Mikko
19 May11:08  i   i   i      `* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C3Richard Heathfield
19 May13:32  i   i   i       `* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C2Mikko
19 May13:57  i   i   i        `- Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C1Richard Heathfield
17 May 25  i   i   `* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C4Richard Damon
17 May 25  i   i    `* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C3olcott
17 May09:50  i   i     +- Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C1Fred. Zwarts
17 May13:52  i   i     `- Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C1Richard Damon
16 May 25  i   +* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C3Richard Damon
17 May 25  i   i`* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C2olcott
17 May 25  i   i `- Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C1Richard Damon
17 May10:42  i   `* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C22Mikko
18 May12:05  i    `* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C21Richard Heathfield
18 May23:18  i     `* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C20Ben Bacarisse
19 May01:01  i      +* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C18Richard Heathfield
19 May01:27  i      i`* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C17Ben Bacarisse
19 May01:33  i      i `* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C16olcott
19 May02:02  i      i  +* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C14Richard Heathfield
19 May02:24  i      i  i`* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C13olcott
19 May03:08  i      i  i +* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C11Richard Heathfield
19 May04:16  i      i  i i+* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C8Richard Heathfield
19 May05:12  i      i  i ii`* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C7Richard Heathfield
19 May05:25  i      i  i ii `* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C6olcott
19 May05:57  i      i  i ii  +* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C4Richard Heathfield
19 May06:27  i      i  i ii  i`* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C3olcott
19 May07:17  i      i  i ii  i +- Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C1Richard Heathfield
19 May10:54  i      i  i ii  i `- Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C1Mikko
19 May12:00  i      i  i ii  `- Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C1Richard Damon
19 May10:49  i      i  i i+- Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C1Mikko
19 May11:56  i      i  i i`- Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C1Richard Damon
19 May10:41  i      i  i `- Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C1Mikko
19 May10:36  i      i  `- Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C1Mikko
19 May10:29  i      `- Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C1Mikko
16 May 25  +* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C5Richard Damon
16 May 25  i`* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C4olcott
16 May 25  i `* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C3Richard Damon
16 May 25  i  `* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C2olcott
16 May 25  i   `- Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C1Richard Damon
16 May 25  `* Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C134Mikko
16 May 25   `* Mike Terry Proves --- How the requirements that Professor Sipser agreed to are exactly met133olcott
17 May11:06    `* Re: Mike Terry Proves --- How the requirements that Professor Sipser agreed to are exactly met132Mikko
17 May18:15     `* Re: Mike Terry Proves --- How the requirements that Professor Sipser agreed to are exactly met131olcott
17 May20:58      +* Re: Mike Terry Proves --- How the requirements that Professor Sipser agreed to are exactly met3Richard Damon
17 May21:03      i`* Re: Mike Terry Proves --- How the requirements that Professor Sipser agreed to are exactly met2olcott
18 May10:12      i `- Re: Mike Terry Proves --- How the requirements that Professor Sipser agreed to are exactly met1Mikko
18 May10:09      `* Re: Mike Terry Proves --- How the requirements that Professor Sipser agreed to are exactly met127Mikko
18 May16:21       +* Re: Mike Terry Proves --- How the requirements that Professor Sipser agreed to are exactly met120Mike Terry
18 May18:28       i`* Re: Mike Terry Proves --- How the requirements that Professor Sipser agreed to are exactly met119olcott
18 May20:08       i +* Re: Mike Terry Proves --- How the requirements that Professor Sipser agreed to are exactly met28joes
18 May20:18       i i`* Re: Mike Terry Proves --- How the requirements that Professor Sipser agreed to are exactly met27olcott
18 May20:30       i i +- Re: Mike Terry Proves --- How the requirements that Professor Sipser agreed to are exactly met1Richard Damon
19 May11:12       i i `* Re: Mike Terry Proves --- How the requirements that Professor Sipser agreed to are exactly met25Mikko
20 May05:10       i i  `* Re: Mike Terry Proves --- How the requirements that Professor Sipser agreed to are exactly met24olcott
18 May20:25       i `* Re: Mike Terry Proves --- How the requirements that Professor Sipser agreed to are exactly met90Richard Damon
18 May19:36       `* Re: Mike Terry Proves --- How the requirements that Professor Sipser agreed to are exactly met6olcott

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal