We often hear that what’s hard for humans is easy for computers. But it turns out that many kinds of problems are exceedingly hard for computers to solve. This class of problems, known as NP-Complete (NPC), was independently discovered by Stephen Cook and Leonid Levin.