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.
-
-
Are you familiar with asymptotic time complexity aka Big-O? That (and maybe the concept of a reduction) are the only challenging concepts required.
-
Tweet unavailable
-
"class of complexity problems with optimal algorithmic solution in polynomial time" = any problem you can solve in O(n^k) for any k = P NP = problems you can _check if you solved correctly_ in O(n^k) but we dunno if there's a way to _solve_ them in O(n^k)
- 7 more replies
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.