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

On 21/05/2025 18:47, olcott wrote:

On 5/21/2025 12:16 PM, Richard Heathfield wrote:

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.
>

>
*PAY ATTENTION*
I am saying that a key element of the halting problem
proof cannot exist, thus the proof itself cannot exist.

 Yes, it can, and it does.
 Watch.