Every problem in NP can be reduced to the satisfiability problem, which is the cornerstone of computational complexity theory.

The best way to predict the future is to invent it.

惩罚教会的是恐惧，而不是责任感。