i even had it on my license plate:
after nightmares involving np complete problems, i finally started considering that p didn't equal np, and suddenly the world made much more sense.
About your turnover on the PvsNP problem, did that have to do with realizing that approximations can be quite good for practical purposes? What's the current state of approximations in the field?
I find it interesting because the only application I know where approximations are complete garbage is cryptography, or "adversarial" applications; is that right? In that case P!=NP yields the best of both words: we can build trapdoor functions for adversarial systems but still solve optimization problems well. I find that picture very convincing for some reason (exact solutions are hard, usable approximations are easy).
a world where P = NP is a much darker world.
"We cannae conceive how it can be bearable to be so" !==> "It can not be so"