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

On 22/05/2025 19:58, olcott wrote:

On 5/22/2025 1:49 PM, Richard Heathfield wrote:

On 22/05/2025 19:46, olcott wrote:

<snip>

KEY ELEMENT OF THE CONVENTIONAL HALTING
PROBLEM PROOFS CANNOT POSSIBLY EXIST.

>
What it proves is that the universal termination analysis program cannot exist.
>

 Show HOW it proves that

I have done so several times in the past few weeks. You never get it.
You can find the proof here:
https://www.cs.virginia.edu/~robins/Turing_Paper_1936.pdf

and I will point out your mistake.

No, you'll just copy and paste your own mistake. (Again.)

(You don't know how, you are only a parrot)

RAAARK! Pretty Polly.
--
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