Define the P vs NP problem within the context of computational complexity theory. Analyze the profound consequences for cryptography, optimization, and artificial intelligence if it were proven that P equals NP. Conversely, explain the continued significance of NP-completeness and the practical limitations it imposes on algorithm design if it is proven that P does not equal NP.