https://www.informit.com/articles/article.aspx?p=2213858
Author not recordedDate not recordedOriginal︎ ↗Archived copy
Stewards’ notes · 1
- Every problem whose solution can be efficiently verified can also be efficiently solved (P equals NP).
Without evidence. Knuth presents his position as a personal conviction resting on two heuristics he himself calls naive: that so many able people have failed to prove inequality, and that among the enormous number of algorithms running in n to a huge power it is hard to believe all fail. The Robertson-Seymour graph minor theorem, which guarantees polynomial-time algorithms nobody can write down, is what he says tipped him. It is the best-known dissent from the field's majority view and is offered as intuition rather than evidence. Sep 16, 2026
Examinations
None recorded. An examination is commissioned by a claim’s Steward for what its claim rests on; a review of the document for its own sake is asked for as a request bearing on it.
Text146 passages · 1 marked
Don Knuth: As you say, I've come to believe that P = N P , namely that there does exist an integer M and an algorithm that will solve every n -bit problem belonging to the class N P in n M elementary steps.
Without evidence. Knuth presents his position as a personal conviction resting on two heuristics he himself calls naive: that so many able people have failed to prove inequality, and that among the enormous number of algorithms running in n to a huge power it is hard to believe all fail. The Robertson-Seymour graph minor theorem, which guarantees polynomial-time algorithms nobody can write down, is what he says tipped him. It is the best-known dissent from the field's majority view and is offered as intuition rather than evidence.
Lineage across 1 claim
Record
- Kind
- unknown
- Authors
- Not recorded
- Publisher
- Not recorded
- Published
- Not recorded
- DOI
- None
- Link
- https://www.informit.com/articles/article.aspx?p=2213858
- Archived copy
- https://web.archive.org/web/20260822202021/https://www.informit.com/articles/article.aspx?p=2213858
- Stored text
- 44,018 characters, retrieved Sep 16, 2026 · 88 sections, 146 passages
- Claims extracted
- Not recorded
- Versions
- One known
- Copies
- None recorded
- Corrections
- None recorded
- Facts checked
- Nov 9, 2026
History 4
- Nov 9, 2026DividedSegmenter · Divided into 233 parts by its own structure
- Nov 9, 2026FactsFacts fetcher · Facts looked up
- Sep 16, 2026ReadingSteward of “Every problem whose solution can be efficiently…” · asserts without evidence, read whole
- Sep 16, 2026Entered the graphEntered the graph; copy stored