#2: Jan 27th 2012 at 9:49:12 AM
But-but-but this proof is the one that's gonna crack it once and for all!
What's the frequency Kenneth?|In case of war.
#3: Jan 27th 2012 at 10:16:23 AM
Too bad, you'll have to publish it into a second-rate journal.
I hope that the million dollars Millennium Prize for solving it, your pick for a permanent position at whatever university you'd like and the hot computer scientist groupies that that solution will get you will be consolation enough...
As an aside, I mentioned the Millennium Prize to my parents once, in answer to their query if one could get filthy rich doing the sort of thing I do.*
Their answer?
Bah, a million dollars is nothing. A good lawyer can get richer than that.
And the thing is, they are right...
edited 27th Jan '12 10:20:12 AM by Carciofus
But they seem to know where they are going, the ones who walk away from Omelas.
MarkVonLewis
Since: Jun, 2010
TheOneWhoTropes
Dread Sorcerer of Auchtermuchty
from Newton-le-willows, quaint town
Since: Feb, 2010
Relationship Status: With my statistically significant other
Total posts: 6

This is hilarious.
Some context: the Journal of the ACM is one of the most important computer science-related academic journals around. A lot of huge papers get published there, and it's generally one of the go-to places were to publish very big results.
Apparently they are having some problems with people submitting faulty proofs of P/NP (the biggest and most famous open problem in theoretical computer science right now). Enough problems, it appears, for them to make a policy that
So yeah. You are not allowed to solve P/NP more often than once every two years.
edited 27th Jan '12 9:10:24 AM by Carciofus
But they seem to know where they are going, the ones who walk away from Omelas.