Are you sure you know what undecidable means? Because it's not an answer to this question.
>>11233993No, if P = NP then it follows that P = NPC. If P = NP, then any NP problem is also NP-hard, because you can reduce problems to the NP problem in polynomial time using the "solve the original problem and ignore the reduction target" reduction.
>there are NP problems explicitly outside NPC.There are NP problems explicitly outside NPC assuming P != NP. There are none for which we know this unconditionally.
