Define the theoretical P vs NP problem in computational complexity theory. Explain the significance of this problem to computer science and mathematics, discussing the implications if P were to equal NP versus if P does not equal NP. Provide examples of problems that fall into each category.