What are titles of research papers that should exist?
-
-
Replying to @danielgross
Heh. Fun prompt. "A proof that P versus NP is formally undecidable."
2 replies 2 retweets 16 likes -
Replying to @michael_nielsen @danielgross
This one warps my brain a little - wouldn’t proving it undecidable mean we could never find an NP problem in P? Would this not imply P ≠NP?
1 reply 0 retweets 0 likes
Replying to @finigan_will @danielgross
There could be, say, a polynomial-time algorithm to solve an NP-complete problem, but it's not provably polynomial time.
11:45 AM - 25 Sep 2019
0 replies
0 retweets
1 like
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.