Question: is p vs np solvable?
Answer: The P versus NP problem is a major unsolved problem in computer science. It asks whether every problem whose solution can be quickly verified can also be solved quickly. ... The general class of questions for which some algorithm can provide an answer in polynomial time is called "class P" or just "P".