WOW!! the flash on Twitter (and Slashdot) tonight that one of the complex Clay Institute Millennium problems, "P vs. NP" (worth a million dollars to solve, and especially of interest to computer scientists), is being claimed proved by an HP Labs researcher as P ≠ NP. He notes his solo effort involved "uncovering a chain of conceptual links between various fields and viewing them through a common lens," as might be expected.
Story originally sourced here:
Another early report on the news HERE.
100-page proof likely to take months or more to be verified.