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

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. Actually solving
the Halting Problem requires making a computer program
that is literally all knowing about program termination.
When one understands that halt deciders are only allowed
apply finite string transformations to input finite
strings and
these transformations are defined by the language then it
becomes unequivocally clear (if one bothers to pay complete
attention and knows the x86 language) that the input to
HHH(DD) is correctly rejected as non halting.
The behavior of the direct execution of DD cannot possibly
be derived by applying the finite string transformation
rules specified by the x86 language to the input to HHH(DD).
--
Copyright 2025 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer