Question: is p vs np undecidable?
Answer: If P = NP, it is decidable. Because this states that there must be an algorithm for generating solutions in polynomial time. If an algorithm exists, we should be able to find it, and hence prove P = NP. ... NP (P does not equal NP), then this could be undecidable or decidable.