Yes! It's exciting to know that we're finally (fairly) close to solving P != NP....it's the first claimed proof from a credible source. Everyone I know who's studying theoretical computer science has had their hands full the last few days.
For those interested,
I have to disagree there. First off, that would mean some of our encryption algorithms would not be secure, AND the proof would indirectly suggest a method of attack. Besides that, much research has assumed that P=/=NP
That's exactly why I was saying it would be neat. Proving something you know to be true has it's own merits. But having to rethink everything you know because it's been disproven, now that's a radical shacking up. Deep down though I do believe P!=NP ...
Do you know that you can use P=NP problem to fight scammers?
The following blog post is funny. As soon as you ask them about the proof, things turn unexpectedly.
This site uses cookies to help personalise content, tailor your experience and to keep you logged in if you register.
By continuing to use this site, you are consenting to our use of cookies.