P != NP (will it be proven by April 2027)
55
1kṀ60092027
3%
chance
1D
1W
1M
ALL
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)
This question is managed and resolved by Manifold.
Get
1,000 to start trading!
People are also trading
If P=NP is proven, will the first proof be constructive?
29% chance
Will P vs NP be resolved by 2043?
49% chance
Will the alleged proof of P!=NP by Ke Xu and Guangyan Zhou be recognized as valid by 2050?
10% chance
Will P vs NP be resolved before man lands on Mars?
38% chance
Will P vs PSPACE be resolved before P vs NP?
71% chance
Will geometric complexity theory solve P vs NP?
10% chance
Will AI resolve P vs NP by 2050?
39% chance
Will a polynomial-time algorithm for an NP-complete problem be published by 2030?
4% chance
Will a proof of Fermat's Last Theorem simple enough for Fermat to have possessed be found by 2027?
5% chance
Will we be able to solve all NP problems in polynomial time by 2200? (any practical computation method, e.g. BPP, BQP)
2% chance
Sort by:
People are also trading
Related questions
If P=NP is proven, will the first proof be constructive?
29% chance
Will P vs NP be resolved by 2043?
49% chance
Will the alleged proof of P!=NP by Ke Xu and Guangyan Zhou be recognized as valid by 2050?
10% chance
Will P vs NP be resolved before man lands on Mars?
38% chance
Will P vs PSPACE be resolved before P vs NP?
71% chance
Will geometric complexity theory solve P vs NP?
10% chance
Will AI resolve P vs NP by 2050?
39% chance
Will a polynomial-time algorithm for an NP-complete problem be published by 2030?
4% chance
Will a proof of Fermat's Last Theorem simple enough for Fermat to have possessed be found by 2027?
5% chance
Will we be able to solve all NP problems in polynomial time by 2200? (any practical computation method, e.g. BPP, BQP)
2% chance