Re:A Solution of the P versus NP Problem?
by Analemma_ on Monday August 14, 2017 @04:32PM
(#15012586)
But keep in mind that he (and just about everyone who believes P = NP) thinks any proof of it will be non-constructive and that we will never actually find a polynomial-time algorithm for NP problems.
Donald Knuth believes P = NP.
Source: http://www.informit.com/articles/article.aspx?p=2213858&WT.m... (question 17). Also cf. https://www.quora.com/Why-does-Donald-Knuth-think-that-P-NP