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

On 4/21/25 7:41 PM, Mr Flibble wrote:

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.
 Flibble's Law:
 If a problem permits infinite behavior in its formulation, it permits
infinite analysis of that behavior in its decidability scope.
 /Flibble
 

Which is just a false statement, and thus a LIE.
We don't know if Goldbach's Conjecture can be SOLVED using a Simulating Halt Decider with infinite resources, as we don't know that such a machine will ever give an answer.
Note, a machine checking every number, will NEVER reach its final state if the conjecture is true. So even given unbounded time, it still doesn't answer.