P != NP (will it be proven by April 2027)
Science•Math•Computational Complexity Theory•Millennium Prize Problems
50
395
Ṁ469
2027
5%
chance

Will this be proven to the satisfaction of most mathematicians and computer scientists in 5 years? Apr 7, 12:55pm: Companion market here (for P = NP) https://manifold.markets/LarsDoucet/p-np

Mar 14, 4:41pm: P != NP → P != NP (will it be proven by April 2027)

Get Ṁ200 play money

Related questions

4 Comments
41 Holders
267 Trades
Sort by:
predicts YES

This title is highly misleading, would you mind fixing it?

> Will this be proven to the satisfaction of most mathematicians and computer scientists in 5 years? If the claim "P != NP" is not proven to be true to the satisfaction of most mathematicians and computer scientists in 5 years, it resolves to No.
The way it's phrased it implies you'll resolve to `N/A` if nothing changes from the status quo-- there's no proof either way. Is this what you intend? It's also unclear how to resolve if there's a formal undecidability proof of `=` or `!=`
Comment hidden

Related in Science

See more Science questions

Related in Math

See more Math questions

Related in Computational Complexity Theory

See more Computational Complexity Theory questions

Related in Millennium Prize Problems

See more Millennium Prize Problems questions

More related questions