News for hackers. Stuff that matters.
Re:A Solution of the P versus NP Problem? by bmh_ca on Monday August 14, 2017 @01:59PM (#15010866)
> I doubt that.

Let me clarify: Nobody appeared to be interested in funding a graduate student to prove P != NP.

Re:A Solution of the P versus NP Problem? by gregfjohnson on Monday August 14, 2017 @03:02PM (#15011567)
Your clarification makes sense - a PhD advisor with a bit of NSF or other grant money would likely only fund a grad student to work on a problem that has a reasonable likelihood of generating some concrete, positive, and publishable results. This typically means an incremental result on a problem of interest to the research community.

That having been said, an accepted proof that P != NP would result in a Turing award and an additional $1M for solving one of the seven Millenium Prizes. This has been an open problem for decades, and it is a problem of enormous importance and visibility.

Re:A Solution of the P versus NP Problem? by dhosek on Monday August 14, 2017 @02:17PM (#15011037)
Although that might be based on the perceived likelihood of success. After all, pre-Wiles, I doubt there was much chance of a grad student getting funding to prove Fermat. Nor is a grad student likely to get funded to prove the Riemann Hypothesis.
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.