It's true I did not understand you were joking, but I didn't personally malign you either. If you are referring to the word "moron", I didn't call you a moron; I was shocked that you thought P vs. NP was so trivial, and asked whether you therefore thought everyone puzzling over it was a moron.
As for whether "the physical model of P != NP is definitionally trivial", I suppose it depends on what "the physical model" is, but I don't see any physical reason why it should trivially be impossible to decide the Boolean satisfiability problem in polynomial time... Why shouldn't there be some algorithm to do so?
I didn't malign others, either, as I didn't call anyone a moron... Yes, it's true I implied that you might think that others who puzzled over P vs. NP were morons. I was, after all, laboring under the belief that you thought P vs. NP was trivial. Is that a malignment?
Anyway. Nevermind that. Feynman joked that P was trivially not equal to NP? Where can I find that joke given by Feynman?
