Re:A Solution of the P versus NP Problem?
by Blaisorblade0 on Wednesday August 16, 2017 @09:32PM
(#15032970)
Because (I'd guess, as a PhD student in another CS field) any advisor worth its salt would advise a grad student to work on something else first, get tenure, and then maybe approach this problem. Until yesterday, most researchers agreed that the problem was unapproachable.
Nowadays being a researcher is a job that requires steady progress, so you must focus on approachable problems. For P vs NP there are tons of results on classes of techniques that _cannot_ work—you'd have to learn those first to make a serious attempt.
[ Parent
| on HN ]
There are no comments on this comment yet.