Mod Parent Up!

From the article: "By showing that some common game-theoretical problems are so hard that they’d take the lifetime of the universe to solve, Daskalakis is suggesting that they can’t accurately represent what happens in the real world." But he didn't actually show this. He showed (again from TFA): "Daskalakis proved that the Nash equilibrium belongs to a subset of NP consisting of hard problems with the property that a solution to one can be adapted to solve all the others." I.e. computing the Nash equilibrium is NP-complete. These problems have no efficient solution if (and only if) P != NP. That is if there is a polynomial (efficient) solution for any of these, then there is a polynomial time solution for all. We don't know WHETHER THAT'S TRUE. Computer scientists suspect very strongly that there is no polynomial time solution for these problems, but it isn't known for sure.

Quinn: "Why do you think they call me Dr. Quinn?"
Stormy (flashing west side hand signal): "I thought it was a nickname, you know, like Dr. Dre. Eastsiiide!"
Sparks: "God you're stupid."

Seriously. Silverlight is gaining on flash in all areas. What about portability ... open standards ... interoperability. Not that flash is really that much better, but at least Adobe is making a token effort.

Actually shouldn't have TOO much effect. I can't comment on the cylinders of CO2 used in pumping or carbonation, but the CO2 that the yeast releases is balanced by the CO2 which the plant absorb in order to produce the sugar that is fermented.

As to how many petrochemicals/fossil fuels are used in the production/creation of those plants and that sugar, that's a different story, but that is less related to alcohol specifically and more to how our agricultural/transportation system function generally.

If it is done in polynomial time, then it would by definition be in P which means it would NOT be NP complete unless P=NP.

I think you are trying to ask how it could be done in less than exponential time (which is how fast the fastest algorithms to solve NP complete problems run).

I personally would expect an algorithm to perform the match would run in O(U*US+K*KS+UI*KI*U) where U=the number of unknown (ie flickr pictures), K=the number of known pictures, US=the average size of an unknown picture, K=the size of the average known picture, UI=the number of interesting things in an unknown picture and KI=the number of interesting things in a known picture. However, it would often run faster because it should be fairly easy to disqualify two pictures as containing any of the same interesting features.

Canadian pr0n... Interesting concept, but wouldn't the hockey sticks get in the way?

Or better yet, email him: RIF@scsenate.org

Maybe he was kidding?

I only pretend to work you insensitive clod!

That's right. Soon the only people not in the government db will be those who entered the country illegally outside of designated entry points.