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 : rjh (at) *nospam* cpax.org.uk (Richard Heathfield)
Groupes : comp.theory
Date : 16. May 2025, 00:57:13
Autres entêtes
Organisation : Fix this later
Message-ID : <1005v0p$3b07v$1@dont-email.me>
References : 1 2 3
User-Agent : Mozilla Thunderbird
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
That's not a given. It's an 'if'.
<snip>
--
Richard Heathfield
Email: rjh at cpax dot org dot uk
"Usenet is a strange place" - dmr 29 July 1999
Sig line 4 vacant - apply within

Date Sujet#  Auteur
27 Apr 26 o  …

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal