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

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.
We can paint it in words, but we can't nail it down with a finite step-by-step procedure.
Turing showed how to paint it in words.
I can't implement it for the same reason you can't, which is that it can't exist. Turing proved this.
--
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