User sisko misko - MathOverflow most recent 30 from http://mathoverflow.net 2013-06-19T03:51:05Z http://mathoverflow.net/feeds/user/8823 http://www.creativecommons.org/licenses/by-nc/2.5/rdf http://mathoverflow.net/questions/34980/how-can-an-approach-to-p-vs-np-based-on-descriptive-complexity-avoid-being-a/36871#36871 Answer by sisko misko for How can an approach to $P$ vs $NP$ based on descriptive complexity avoid being a natural proof in the sense of Raborov-Rudich? sisko misko 2010-08-27T11:01:22Z 2010-08-27T11:01:22Z <p>His proof is wrong. Completely. It makes no sense whatsoever. Haven't you heard?</p>