News for hackers. Stuff that matters.
Re:An Argument for P=NP (2005) [pdf] by airza on Monday August 17, 2015 @01:50PM (#10074810)
If anyone with expertise has been lured in by this nonsense paper, do any of you think (like me) that P=NP is undecidable in ZFC?
Re:An Argument for P=NP (2005) [pdf] by ddinh on Monday August 17, 2015 @02:10PM (#10074952)
Scott Aaronson wrote a survey about that topic here: http://www.scottaaronson.com/papers/pnp.pdf