Re: Olcott admits that the Halting Problem is undecidable

Liste des GroupesRevenir à theory 
Sujet : Re: Olcott admits that the Halting Problem is undecidable
De : chris.m.thomasson.1 (at) *nospam* gmail.com (Chris M. Thomasson)
Groupes : comp.theory
Date : 23. Oct 2025, 20:06:59
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <10dducj$21qur$2@dont-email.me>
References : 1 2 3
User-Agent : Mozilla Thunderbird
On 10/23/2025 7:45 AM, olcott wrote:
On 10/23/2025 6:01 AM, Bonita Montero wrote:
Am 26.09.2025 um 02:23 schrieb Mr Flibble:
Olcott admits that the Halting Problem is undecidable with the following
words quoted verbatim:
>
DD is the caller of HHH(DD) that does the opposite of whatever HHH(DD)
reports. This makes it logically impossible for HHH to correctly report
on the behavior of its caller no matter what HHH does.
>
So if HHH is asked the question does my caller halt?
It is logically impossible for HHH to provide a correct answer.
>
/Flibble
>
>
It doesn't matter, Pete is nuts.
You can argue about it for years, but he won't accept any of it.
>
 Your comment meets the standard of defamation of character
 
Like when you say others do no know C enough to grok your crap?

Date Sujet#  Auteur
23 Oct 25 * Re: Olcott admits that the Halting Problem is undecidable4Bonita Montero
23 Oct 25 `* Re: Olcott admits that the Halting Problem is undecidable3olcott
23 Oct 25  +- Re: Olcott admits that the Halting Problem is undecidable1Chris M. Thomasson
23 Oct 25  `- Re: Olcott admits that the Halting Problem is undecidable1Kaz Kylheku

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal