dcosson

48 ms·

1. 421.▲
   by dcosson 16y ago

   Love the dubstep suggestion. I too do my best coding when I feel like a boss
2. 422.▲
   by dcosson 16y ago

   Haha good catch. Should read "factors numbers into primes".
3. 423.▲
   by dcosson 16y ago

   "Hello World" isn't a decision problem, but I see your point. However NP-Complete (and by extension NP-Hard) and P are distinct classes of problems, http://en.wikipedia.org/wiki/NP-complete so my statement that factorization is not an NP
4. 424.▲
   by dcosson 16y ago

   Factorization is NOT NP-hard. There has never been a proof that guarantees I can't wake up tomorrow and factor any public key on the internet in polynomial time. It just so happens that nobody has figured out how to do it in the history o
5. 425.▲
   by dcosson 16y ago

   Haha, this is awesome. And fairly accurate.
6. 426.▲
   by dcosson 16y ago

   It seems like the title of this post doesn't quite agree with the example given. The company started charging for their version 1, but they already had a not-insignificant user base of 1000 people that seemed to like the product. It's pos