On 10/15/23 10:03 AM, olcott wrote:
> A PhD computer science professor came up with a way to show that
> Turing's halting problem proof is erroneous. I have simplified it for
> people that know nothing about computer programming.
>
Perhaps you should try to quote the ACTUAL proof, as your
"simplification" is truly broken.
My guess is you don't actually understand what the "PhD Computer Science
Professer" was actually saying, and he is not saying what you think he is.
> One thing that I found in my 20 year long quest is that self-
> contradictory expressions are not true. “This sentence is not true.” is
> not true and that does not make it true. As a corollary to this self-
> contradictory questions are incorrect.
>
> Linguistics understands that when the context of [who is asked] changes
> the meaning of this question, this context cannot be correctly ignored.
> When Jack's question is posed to Jack it has no correct answer.
Except that "Does the Program & Input described by the Input Halt when
it is run?" doesn't depend on who you ask it to.
>
> Can Jack correctly answer “no” to this [yes/no] question?
Which is just a dead Red Herring that you are flogging, showing your
lack of actual argument.
>
> Jack's question when posed to Jack meets the definition of an incorrect
> question in that both answers from the solution set of {yes, no} are the
> wrong answer.
>
> *Simplified Halting Problem Proof*
> Likewise no computer program H can say what another computer program D
> will do when D does the opposite of whatever H says.
So? That just means that all programs that try to be a Halt Decider will
get some questions wrong. Note, each decider gets a different problem wrong.
>
> This meets the definition of an *incorrect decision problem instance*
> When decision problem instance decider/input has no correct Boolean
> value that the decider can return then this is stipulated to be an
> incorrect problem instance.
Nope, the decision problem HAS a correct answer, it just isn't the one
that H gives. Thus your argument is based on a LIE.
For your H, the answer is YES, because H will say no, and thus the
"Pathological" program will halt.
>
> We could also say that input D that does the opposite of whatever
> decider H returns is an invalid input for H.
>
Then you have just defined that your system of computation is weaker
than the Turing system, so isn't Turing Complete.
You can't make a claim for "All Machines" and then exclude some.
> As everyone knows the technical term *undecidable* does not mean that
> an algorithm is too weak to find the steps required to reach a correct
> Boolean return value.
>
> It actually means that no correct Boolean return value exists for this
> decision problem instance.
Right, but the correct return value DOES exist, it is just that H
doesn't give it, so H is wrong.
Remember, the question is NOT "What answer can H give ...?" but "Does
the Machine ... Halt?". The question is NOT about what the decider does,
but what the machine described by the input, and then the question of
can you make a machine that does that.
The answer to the second question is NO, there exists no machine that
correctly gives the answer to all inputs.
>
> Because people subconsciously implicitly refer to the original meaning
> of undecidable [can't make up one's mind] they misconstrue a
> decider/input pair with no correct Boolean return value from the decider
> as the fault of the decider and thus not the fault of the input.
>
>
No, YOU are the one stuck on the wrong definition. Halting is
Undecidable, as it is IMPOSSIBLE to make a Program that can give the
correct answer for all possible inputs. There is always a correct answer
to the question of does the program described by the input Halt, it is
just that for every decider we try, we can make an input it will get
wrong. Thus, the problem IS undecidable, and your logic is shown to be
invalid.
You are just proving your stupidity.