Every problem in NP can be reduced to the satisfiability problem, which is the cornerstone of computational complexity theory.
Don't let the noise of others' opinions drown out your own inner voice.
The only limit to our realization of tomorrow is our doubts of today.