Turning P and NP on its head // overwhelm machines

The classic P versus NP problem in computer science asks: Can every problem that is quickly verifiable (NP) can also be quickly solved (P)? The classic example being something like Sudoku: it's easy to check if a grid is correct, but it's difficult to complete it. Or for a certain program's behavior, it's (usually) harder to code it than to check if the output is correct. With the new tools around…