Hacker News new | past | comments | ask | show | jobs | submit login

Is it likely that a proof of P!=NP will give insight into designing more efficient algorithms? Or mostly insight into proving other lower bounds?



Perhaps we could get new upper bounds out of it. Or---perhaps the eventual proof will establish a link between hitherto unrelated areas of mathematics. This link could be used to transform whole classes of theorems and proof structures / ideas from one field to another.


I think his argument is that such a proof would represent a significant advance in human knowledge. At its time of origin, the special theory of relativity didn't give anyone nicer cars, either.




Consider applying for YC's Spring batch! Applications are open till Feb 11.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: