Something I actually believe: That P=NP, and that it’ll be proven by someone finding a simple sublanguage for expressing P problems that admits a simple unification algorithm for instantiating solutions.
-
Knuth suspects P = NP. The cardinality of P is uncountably infinite. So what are the odds that out of that immense infinity there exists no solution to NP-Complete problems?
I don't know if that follows. The set of real numbers > 2 is uncountably infinite, but we can say with certainty that none of those numbers is <= 2.
-
-
It's more an intuition than anything else. He's also said that, were it true, no one would be capable of understanding the algorithms.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.