"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)
Funny example, given that you know the name Bram Cohen because he spent years absorbing dry, abstract maths.
-
-
Which brings us to the efficient market hypothesis and P = NP! Maths are public information. You can still make money with them. QED af
-
Tweet unavailable
-
You want a job with a decent salary? Javascript. You want a conceptual toolkit applicable to many problems (including learning JS), that could lead you toward novel solutions? Math.
-
Tweet unavailable
-
If you're capable of doing advanced math, Javascript is an exercise in tedium. Just pay someone from a bootcamp to build a UI for you and instead focus on solving harder problems.
- 8 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.