The P versus NP problem is an unsolved problem in computer science, which asks whether every problem whose solution can be quickly verified by a computer can also be quickly solved by a computer.
The P versus NP problem is an unsolved problem in computer science. Whether every problem can also be quickly solved by a computer. This is what Computer science asks. Every problem's solution can be quickly verified by a computer.