Every problem in NP can be reduced to the satisfiability problem, which is the cornerstone of computational complexity theory.
The method of psychology must be as exact as that of the physical sciences.