Re: Analysis of Flibble’s Latest: Detecting vs. Simulating Infinite Recursion ZFC

Liste des GroupesRevenir à c theory 
Sujet : Re: Analysis of Flibble’s Latest: Detecting vs. Simulating Infinite Recursion ZFC
De : rjh (at) *nospam* cpax.org.uk (Richard Heathfield)
Groupes : comp.theory
Date : 21. May 2025, 18:16:15
Autres entêtes
Organisation : Fix this later
Message-ID : <100l1ov$2ul3j$1@dont-email.me>
References : 1 2 3 4 5 6 7
User-Agent : Mozilla Thunderbird
On 21/05/2025 17:51, olcott wrote:
On 5/21/2025 11:09 AM, Richard Heathfield wrote:
<snip>

That an algorithm for ascertaining whether an arbitrary program with arbitrary input halts cannot actually exist is precisely what the Halting Problem proves.
 If you think that it can exist then prove that it
exists by encoding it in C.
It can't exist. The Halting Problem proves that it can't. I said that already.
Sheesh, you think /I'm/ not paying attention.
--
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
29 Jun 26 o  …

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal