When computer scientists hang out at cocktail parties, they're apt to chat, among other things, about the single most important unsolved problem in computer science: the question, Does P = NP?

For decades, the solution to harder problems has been ‘build a bigger computer’— but what if this is the wrong strategy altogether? This is because some problems defeat computers, not because they are ...

A problem doesn't last a lifetime. But how you deal with it can make it linger for years without resolution. In my studies about the topic, I've identified that, in addition to everything that ...