Revision as of 12:27, 26 September 2009 edit Hermel (talk \| contribs) Extended confirmed users, Pending changes reviewers 2,052 edits m →Translate German WP article?: signed my contributed talk ← Previous edit		Revision as of 23:53, 27 September 2009 edit undo Yobot (talk \| contribs) Bots 4,733,870 edits m Tagging using AWB Next edit →
Line 221: That would have been big news - it definitely isn't right so far. But as a related question - in the section on P=NP, why is finding proofs of theorems in pure mathematics listed as something that could be done more efficiently if P=NP? By ~~Gödel~~Gödel's results, finding proofs of theorems in pure mathematics is an undecidable problem, and is therefore outside every complexity class, so I would have thought that P=NP would be basically irrelevant for it. [[User:Easwaran\|Easwaran]] ([[User talk:Easwaran\|talk]]) 12:12, 14 September 2009 (UTC)

Talk:Computational complexity theory: Difference between revisions