The end-of-show tech flex at Jensen Huang's Computex keynote probably left you confused, cringing, or creeped out.

P vs. NP asks: are these two classes actually the same? If P = NP, then every “hard” problem is secretly fast to solve; we ...