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

Liste des GroupesRevenir à theory 
Sujet : Re: Overcoming the proof of undecidability of the Halting Problem by a simple example in C
De : mikko.levanto (at) *nospam* iki.fi (Mikko)
Groupes : comp.theory
Date : 16. May 2025, 08:15:52
Autres entêtes
Organisation : -
Message-ID : <1006on8$3l9t7$1@dont-email.me>
References : 1 2 3 4 5
User-Agent : Unison/2.2
On 2025-05-16 01:21:04 +0000, olcott said:

On 5/15/2025 6:57 PM, Richard Heathfield wrote:
On 16/05/2025 00:43, olcott wrote:
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.
 Or maybe he just knows what 'if' means.
 
 <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
 It is a verified fact that HHH does simulate DD according
to the rules of the x86 language, thus correctly
 until HHH correctly determines that its simulated DD
would never stop running unless aborted
Otherwise true but the "correctly" is not verified.
--
Mikko

Date Sujet#  Auteur
27 Apr 26 o  …

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal