Not sure if that qualifies as "programming" or CS though..
Wouldn't it be hilarious if it turns out that P=NP, but there's also a proof that the best polynomial algorithm for SAT has polynomial complexity of a ridiculously high order? Like SSCG(TREE(g64)) ridiculous? 
-
-
Show this threadThanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
To be fair, this idea has analogies in the Algorithmic Randomness :P
-
Looking into this subject is on my to-do list since our conversation in August. I'm afraid this item will stay on that list long-term. I need that technology from Matrix (the movie) where you can just upload stuff to your mind. Can someone build this soon pretty please?
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.
(I'm going first)