Doron Zeilberger proved that P is equal to NP

Abstract: Using 3000 hours of CPU time on a CRAY machine, we settle the notorious P vs. NP problem in the affirmative, by presenting a “polynomial” time algorithm for the NP-complete subset sum problem. Alas the complexity of our algorithm is $O(n^{10^{10000}})$ (with the implied constant being larger than the Skewes number).