Re: Refutation of Turing’s 1936 Halting Problem Proof Based on Self-Referential Conflation as a Category (Type) Error

Mr Flibble <flibble@red-dwarf.jmc.corp> writes:

On Mon, 21 Apr 2025 15:08:34 -0700, Keith Thompson wrote:

Are you ever going to answer my questions about Goldbach's Conjecture?

>
Goldbach's Conjecture can be solved using a Simulating Halt Decider with
infinite resources.

That's not what I asked, and it's not interesting.

Do I need to ask the question again, or can you go back and find
what I wrote?

Flibble's Law:
>
If a problem permits infinite behavior in its formulation, it permits
infinite analysis of that behavior in its decidability scope.

That's your assertion.  One more time, you're free to construct a
new mathematical system with that as an axiom.  Such a new system
is less useful and less interesting than the one in which the proof
of the insolubility of the Halting Problem was constructed, which is
about computations that can be completed in a finite number of steps.

--
Keith Thompson (The_Other_Keith) Keith.S.Thompson+u@gmail.com
void Void(void) { Void(); } /* The recursive call of the void */