You're looking at Less Wrong's discussion board. This includes all posts, including those that haven't been promoted to the front page yet. For more information, see About Less Wrong.

cousin_it comments on What independence between ZFC and P vs NP would imply - Less Wrong Discussion

1 Post author: alexflint 08 December 2011 02:30PM

You are viewing a comment permalink. View the original post to see all comments and the full post content.

Comments (62)

You are viewing a single comment's thread. Show more comments above.

Comment author: cousin_it 08 December 2011 08:35:45PM *  5 points [-]

See paulfchristiano's comments. The mistake in DanielLC's comment is that, even though any polynomial algorithm can be "stated in ZFC", the proof that it runs in polynomial time doesn't necessarily lie within ZFC, or ZFC+Con(ZFC), or any other system you can name in advance.

Comment author: orthonormal 08 December 2011 09:18:02PM 0 points [-]

Ah, thanks.