P!=NP is a big deal in computational complexity as

1) It would solve one of the most important problems in computer science and mathematics 2) Understanding of the proof and the methods it uses could very likely lead to solving other problems in computational complexity. 3) Furthermore, the proof would shed light on why certain problems are hard. Such an understanding could lead to better heuristics to solve those problems.

I'm glad you asked, I couldn't figure it out either. I could see P = NP being a big deal, but I thought we'd all been kind of assuming P != NP

@sidww2: Thanks that explains it pretty well. I guess we don't really know why hard problems are hard right now. That sounds important to figure out.

BTW, why can't I respond to sidww2's comment? There's no reply button.

No one explains it on the blog either. They all think I'm asking about P=NP.

Oh well, maybe this guy's life will change if P!=NP is proven, but the rest of us will carry on normally.