For all you Computer Science types...Does P=NP?

I’ve been reading up on the P=NP problem for the last few days now and find it fabulously interesting with far reaching implications if it can be proven.

I particularly like Hubie Chen’s proof by contradiction theory which says…

“Assume P = NP. Let y be a proof that P = NP. The proof y can be verified in polynomial time by a competent computer scientist, the existence of which we assert. However, since P = NP, the proof y can be generated in polynomial time by such computer scientists. Since this generation has not yet occurred (despite attempts by such computer scientists to produce a proof), we have a contradiction. ”

Does anyone else have any theories on this topic, or even have a firmer grasp on it than me. If you do I’d love to hear them.