Thanks for the link. Found this great comment: My expectation, however, is that either P!=NP or if it isn't, we will probably find out because some day, some g

Thanks for the link. Found this great comment: My expectation, however, is that either P!=NP or if it isn't, we will probably find out because some day, some guy wanted his program to run a little faster and he just happens to solve A NP-complete problem in polynomial time, therefore collapsing NP into P (remember, solving one of them solves all of them). Who knows, maybe the source code for some random Indie game someone programmed in his basement already contains the solution and nobody has noticed, a bit like back in the day with quakes "fast-inverse square root", which was so great it's now integral part of graphics computing. And we only noticed because the water looked so great. https://www.reddit.com/r/programming/comments/372634/the_n_vs_np_problem_explained/crj9h4d https://www.reddit.com/r/programming/comments/372634/the_n_v...