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 : polcott333 (at) *nospam* gmail.com (olcott)
Groupes : comp.theory
Date : 21. May 2025, 20:28:17
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <100l9gh$30aak$1@dont-email.me>
References : 1 2 3 4 5 6 7 8 9 10 11 12
User-Agent : Mozilla Thunderbird
On 5/21/2025 2:06 PM, Richard Heathfield wrote:
On 21/05/2025 19:48, olcott wrote:
 <snip>
 
Show how to define a D that actually does the opposite
of what its termination analyzer reports.
 The whole point of the proof is that no algorithm can define a universal halt decider.
 
I have NEVER been talking about that.
I have only been talking about the ACTUAL
conventional proof of the halting problem.
--
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
3 Nov 25 o 

Haut de la page

Les messages affichés proviennent d'usenet.

NewsPortal