News for hackers. Stuff that matters.
Re:Donald Knuth making an Earthshaking Announcement June 30 ... by kloncks on Sunday April 11, 2010 @04:46PM (#1257562)
That will indue live up to the "earth shattering" promise.

I think it might be one of the few, if not the only thing, that would live up to that.

Re:Donald Knuth making an Earthshaking Announcement June 30 ... by baddox on Sunday April 11, 2010 @11:01PM (#1258273)
From the little I know about Knuth, while he is a bit of a joker, he doesn't seem like the type to make an announcement to hype people up. That either leads me to believe this will actually be something huge, or it's just a joke of some sort.
Re:Donald Knuth making an Earthshaking Announcement June 30 ... by sswam on Sunday April 11, 2010 @09:00PM (#1258068)
or perhaps he can break RSA in polynomial time or something like that
Re:Donald Knuth making an Earthshaking Announcement June 30 ... by noamsml on Sunday April 11, 2010 @10:15PM (#1258198)
Pretty sure that's the same thing as proving P=NP.
Re:Donald Knuth making an Earthshaking Announcement June 30 ... by Locke1689 on Sunday April 11, 2010 @11:27PM (#1258315)
No it's not. The factoring problem/RSA problem have never been proven to be NP-complete. Shor's algorithm shows that it's NP, but not NP-complete (or hard). I think it's also in co-NP.
[deleted]
Re:Donald Knuth making an Earthshaking Announcement June 30 ... by PG-13 on Monday April 12, 2010 @12:37AM (#1258414)
Yeah.... but like he said, RSA being in P does not imply that P=NP because RSA has not be shown (and isn't believed) to be NP-complete. If P=NP, then RSA would of course be in P.
Re:Donald Knuth making an Earthshaking Announcement June 30 ... by sswam on Sunday April 11, 2010 @09:00PM (#1258071)
or maybe he's finished another book!!!! :)