A wise man once said that you should never believe something just because you want it to be true.
The concept of NP-completeness has provided a powerful tool for understanding the complexity of computational problems.