Re: [sl4] to-do list for strong, nice AI

From: Pavitra (
Date: Tue Oct 20 2009 - 19:15:56 MDT

Matt Mahoney wrote:
> In fact there are *no* classes of problems that are known to be hard
> to solve but easy to check. That's true even if it turns out that P
> != NP, because you still don't know *which* NP-complete problems are
> hard, just that some of them are.

Just to check: I think you mean "...even if it turns out that P = NP"?

This archive was generated by hypermail 2.1.5 : Wed Jul 17 2013 - 04:01:05 MDT