Printable View
Has anyone proven that NP Complete problems can not be solved quickly?
Isn't it the holy grail of computer science to solve all NP complete problems quickly?
http://en.wikipedia.org/wiki/NP-complete
Once thats figured out, maybe AI will be easier to attain.
Yes, P=NP is one of *the* big problems.
In fact, it's one of the Clay Institute's Millenium Problems.
http://www.claymath.org/millennium/
Though, if you can prove it, then you win $1000000, so probably wouldn't post the solution on a forum :p