In a tangential note, if P=NP, a sufficiently carefully crafted algorithm very much like that suffices to solve any NP complete problem in polynomial time! (Of

In a tangential note, if P=NP, a sufficiently carefully crafted algorithm very much like that suffices to solve any NP complete problem in polynomial time! (Of course the constants are ridiculously, absurdly large) http://lucatrevisan.wordpress.com/2010/03/07/on-the-necessity-of-enumerating-all-programs/ http://lucatrevisan.wordpress.com/2010/03/07/on-the-necessit...