News for hackers. Stuff that matters.
Re:P = NP by mion on Wednesday December 04, 2013 @07:28AM (#6846427)
Agreed, it is bit sensationalist. But what if someone proves it and then we realize that even though it can be done in polynomial time, there's some other constraint (like "x^N but N has to be super big") that renders the result impractical?

I think once someone proves it, it will be obvious in hindsight as a lot of people are just ignoring the isomorphisms in nature.

There are no comments on this comment yet.