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

On 22/05/2025 18:13, olcott wrote:

On 5/22/2025 11:59 AM, Richard Heathfield wrote:

On 22/05/2025 17:45, olcott wrote:
>
<snip>
>

You don't have a clue:

>
Righty-ho.
>

https://en.wikipedia.org/wiki/Halting_problem#Proof_concept

>
Is it this bit you mean?
>
There are programs (interpreters) that simulate the execution of whatever source code they are given. Such programs can demonstrate that a program does halt if this is the case: the interpreter itself will eventually halt its simulation, which shows that the original program halted. However, an interpreter will not halt if its input program does not halt, so this approach cannot solve the halting problem as stated; it does not successfully answer "does not halt" for programs that do not halt.
>

 *The part that the actual link links to*

You like that bit, huh?
I like this bit.
There are programs (interpreters) that simulate the execution
of whatever source code they are given. Such programs can
demonstrate that a program does halt if this is the case: the
interpreter itself will eventually halt its simulation, which
shows that the original program halted. However, an interpreter
will not halt if its input program does not halt, so this
approach cannot solve the halting problem as stated; it does
not successfully answer "does not halt" for programs that do
not halt.
--
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