3 ms·
Fortunately, Greek mathematicians have discovered approaches to handle "beasts" like that thousands of years ago; it's called "reductio ad absurdum" (proof by c
by DrJokepu 17y ago
Fortunately, Greek mathematicians have discovered approaches to handle "beasts" like that thousands of years ago; it's called "reductio ad absurdum" (proof by contradiction). If someone shown that P=NP implied a contradiction, that would disprove the conjecture.
- brazzy 17y agoGood luck finding something that the mere existence of an algorithm with a sub-exponential complexity could contradict. And I didn't state that proving a negative is impossible, just that it's completely different from proving a positive by example and unlikely to benefit from failed attempts to find such an example.