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 rea

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?