P != NP (will it be proven by April 2027) | Manifold

P != NP (will it be proven by April 2027)

55

1kṀ6009

2027

3%

chance

1H

6H

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)

Computational Complexity Theory

Millennium Prize Problems

Get

1,000

to start trading!

People are also trading

Will P vs PSPACE be resolved before P vs NP?

If P=NP is proven, will the first proof be constructive?

Will geometric complexity theory solve P vs NP?

Will AI resolve P vs NP by 2050?

Will a polynomial-time algorithm for an NP-complete problem be published by 2030?

Will P vs NP be resolved before man lands on Mars?

Will a proof of Fermat's Last Theorem simple enough for Fermat to have possessed be found by 2027?

Will we be able to solve all NP problems in polynomial time by 2200? (any practical computation method, e.g. BPP, BQP)

Does NP = PSPACE?

Will we have a formalized proof of Fermat's last theorem by 2029-05-01?

Sort by:

predictedYES

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

People are also trading

Will P vs PSPACE be resolved before P vs NP?

If P=NP is proven, will the first proof be constructive?

Will geometric complexity theory solve P vs NP?

Will AI resolve P vs NP by 2050?

Will a polynomial-time algorithm for an NP-complete problem be published by 2030?

Will P vs NP be resolved before man lands on Mars?

Will a proof of Fermat's Last Theorem simple enough for Fermat to have possessed be found by 2027?

Will we be able to solve all NP problems in polynomial time by 2200? (any practical computation method, e.g. BPP, BQP)

Does NP = PSPACE?

Will we have a formalized proof of Fermat's last theorem by 2029-05-01?

Related questions

Will P vs PSPACE be resolved before P vs NP?

If P=NP is proven, will the first proof be constructive?

Will geometric complexity theory solve P vs NP?

Will AI resolve P vs NP by 2050?

Will a polynomial-time algorithm for an NP-complete problem be published by 2030?

Will P vs NP be resolved before man lands on Mars?

Will a proof of Fermat's Last Theorem simple enough for Fermat to have possessed be found by 2027?

Will we be able to solve all NP problems in polynomial time by 2200? (any practical computation method, e.g. BPP, BQP)

Does NP = PSPACE?

Will we have a formalized proof of Fermat's last theorem by 2029-05-01?

© Manifold Markets, Inc.•Terms + Mana-only Terms•Privacy•Rules