Decidability of $P = NP$?

109 Views Asked by At

(Please, don't sign this as duplicate of this question, they are not.)

Is it possible, that the well-known $P=NP$ conjecture is undecidable in ZFC?

Is there any result about this topic?