I am not a libertarian, but I've met enough who understand "Markets are efficient iff P = NP" to suspect a combination of bad samples and just not listening.
-
-
-
succinctly: it is supposed, but not yet proved, that P != NP. where P is the class of problems with optimal algorithmic solution that is polynomial time complexity and NP is the class of problems where proposed solutions can be checked in polynomial time complexity but...
1 reply 0 retweets 1 like -
...there it is proved that there is no polynomial time complexity algorithm that finds the optimal solution.
1 reply 0 retweets 1 like
If P = NP, then solving a maze (NP) and confirming the solution (P) are the same kind of hard. We're pretty sure they aren't.
11:12 AM - 21 Nov 2017
0 replies
0 retweets
1 like
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.