Re: Proving my 2004 claim that some decider/input pairs are incorrect questions

On 12/03/24 17:12, olcott wrote:

 ∀ H ∈ Turing_Machine_Deciders
∃ TMD ∈ Turing_Machine_Descriptions  |
Predicted_Behavior(H, TMD) != Actual_Behavior(TMD)
 In all of the H/TMD cases above where
Predicted_Behavior(H, TMD) != Actual_Behavior(TMD)
H is being asked a question where both YES and NO
are the wrong answer.

So when I ask this Turing machine:
states={qy,qn}
start_state={qn}
whether it halts, the predicted behaviour is no but the actual behaviour is yes, so that means both YES and NO are the wrong answer, according to you?

It is not that H is gagged and cannot answer, it is
that both YES and NO are the wrong answer.

Once we understand that either YES or NO is the right answer, the whole rebuttal is tossed out as invalid and incorrect.