Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C

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>
--
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
23 Apr 26	…

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal