Here's a lecture, sponsored by the Clay Mathematics Institute (yes, the folks who put up $1 million for the solution of any of the remaining six Millennium Problems) by MIT professor, Michael Sipser. Not claiming this is a walk in the park, but it's an excellent introduction to what is considered the most accessible of the prize problems, as well as to the vital subject of computational complexity theory. The solution to the P versus NP problem would have many important consequences.
No comments:
Post a Comment