Re: ZFC solution to incorrect questions: reject them

On 3/12/24 11:12 AM, olcott wrote:

∀ H ∈ Turing_Machine_Deciders
∃ TMD ∈ Turing_Machine_Descriptions  |
Predicted_Behavior(H, TMD) != Actual_Behavior(TMD)
 There is some input TMD to every H such that
Predicted_Behavior(H, TMD) != Actual_Behavior(TMD)
 When we disallow decider/input pairs that are incorrect
questions where both YES and NO are the wrong answer
(the same way the ZFC disallowed self-referential sets) then
pathological inputs are not allowed to come into existence.

But each of the questions in your set, that for each H^ built on each SPECIFIC H, there is a correct answer, just not the one that H gives, so the ALL the questions are correct.

 Does the barber that shaves everyone that does not shave
themselves shave himself? is rejected as an incorrect question.
https://en.wikipedia.org/wiki/Barber_paradox#
 

RED HERRING.
H^ does not "reference" the decider H that you paired it with, it has a copy of it, so when we examine the question, and modulate the decider to see if a correct answer is possible, we see that it is, since the input still keeps its original behavior.
You are just proving your utter stupidity and lack of understanding of how any of this works.
Likely cause by your using Zeroth order principle  and thus not actually knowing what you are talking about, but are just parroting the words you have seen.