Re: Halting Problem: What Constitutes Pathological Input

On 5/5/2025 5:54 PM, Richard Heathfield wrote:

On 05/05/2025 23:25, olcott wrote:

When we examine this as 100% fully encoded in a
fully specified programming language

 You don't have to do that. You can try, of course, but there's no point.
 

thenn we can
see that the whole idea of an input that does the
opposite of whatever value its termination analyzer
returns cannot actually exist. The contradictory
part is unreachable.

 Or, more generally, you can't write a universal halt decider.
 

More specifically the proof that a general halt decider
cannot exist has several fatal flaws. The only important
one is that the "impossible" input is correctly determined
to be non-halting. The proof of this is in the parts that
you ignore because you don't understand them.

Which is precisely what Turing pointed out in 1936.
 

--
Copyright 2024 Olcott "Talent hits a target no one else can hit; Genius
hits a target no one else can see." Arthur Schopenhauer