Read on Twitter
This is a thread 
that talks about one of the major unresolved problems in computer science:
P versus NP
One of the Millennium Prize Problems, with a $1,000,000
prize for whoever cracks it!
That’s a lot of money. And for a good reason!
that talks about one of the major unresolved problems in computer science:P versus NP One of the Millennium Prize Problems, with a $1,000,000
prize for whoever cracks it!That’s a lot of money. And for a good reason!
For a lot of problems, we can quickly verify whether a given solution is optimal.
But we haven't been able to prove that there is (or isn't) a quick way to come up with that optimal solution.
We just don't know whether we can or can't find those solutions quickly.
2/5
But we haven't been able to prove that there is (or isn't) a quick way to come up with that optimal solution.
We just don't know whether we can or can't find those solutions quickly.
2/5
If P = NP 
all problems that can quickly be verified can also be solved quickly.If P != NP there are problems that are much harder to solve than verify.
I believe that P != NP. Most people do, but we haven’t found a way to prove it!3/5
If we could prove P versus NP (either way) the consequences will be massive! 
If P = NP, we could cure cancer! We could also break into most modern cryptographic systems, among other things.
If P != NP, we could stop focusing so much time on this problem.
4/5
If P = NP, we could cure cancer! We could also break into most modern cryptographic systems, among other things.
If P != NP, we could stop focusing so much time on this problem.
4/5
Either way, there's a massive $1M for whoever cracks it!
What do you think? Is P = NP?
(Here is the previous thread about some NP-Hard problems that we found in our lives: https://twitter.com/svpino/status/1285563816886128642?s=20)
5/5
for whoever cracks it!What do you think? Is P = NP?
(Here is the previous thread about some NP-Hard problems that we found in our lives: https://twitter.com/svpino/status/1285563816886128642?s=20)
5/5
