Sujet : Re: Refutation of Turing’s 1936 Halting Problem Proof Based on Self-Referential Conflation as a Category (Type) Error
De : mikko.levanto (at) *nospam* iki.fi (Mikko)
Groupes : comp.theoryDate : 26. Apr 2025, 09:19:27
Autres entêtes
Organisation : -
Message-ID : <vui4uf$20dpc$1@dont-email.me>
References : 1 2 3 4
User-Agent : Unison/2.2
On 2025-04-25 16:31:58 +0000, olcott said:
On 4/25/2025 3:46 AM, Mikko wrote:
On 2025-04-24 15:11:13 +0000, olcott said:
On 4/23/2025 3:52 AM, Mikko wrote:
On 2025-04-21 23:52:15 +0000, olcott said:
Computer Science Professor Eric Hehner PhD
and I all seem to agree that the same view
that Flibble has is the correct view.
Others can see that their justification is defective and contradicted
by a good proof.
Some people claim that the unsolvability of the halting problem is
unproven but nobody has solved the problem.
For the last 22 years I have only been refuting the
conventional Halting Problem proof.
Trying to refute. You have not shown any defect in that proof of the
theorem. There are other proofs that you don't even try to refute.
Not at all. You have simply not been paying enough attention.
Once we understand that Turing computable functions are only
allowed
Turing allowed Turing machines to do whatever they can do.
-- Mikko
…