Re:A Solution of the P versus NP Problem?
by dubstepjuggalo on Tuesday August 15, 2017 @05:05PM
(#15022560)
Uh... P ISN'T known to equal NP, but people seem to have a lot of fun using computers anyway.
Arguably, P=NP makes CS less fun, since an efficient "universal algorithm" could solve a vast class of problems in polynomial time, while P != NP means there's more room for programmer creativity making intractable problems tractable in special cases.
Arguably, P=NP makes CS less fun, since an efficient "universal algorithm" could solve a vast class of problems in polynomial time, while P != NP means there's more room for programmer creativity making intractable problems tractable in special cases.