Is P vs NP solvable? | Manifold

Is P vs NP solvable?

27

Ṁ1kṀ2k

3000

69%

chance

1H

6H

1D

1W

1M

ALL

Is it solvable within the standard framework for mathematics (ZFC)?

Get

1,000

to start trading!

People are also trading

What is the complexity theoretic status of P vs NP, ETH, and Graph Isomorphism?

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

Will P vs NP be resolved by 2043?

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

Will P vs NP be proven to be solvable by the end of 2030?

Can NP-complete problems be solved in polynomial time?

When will someone successfully solve P vs NP?

When will P=NP Problem be solved or proved not solvable?

Will P vs PSPACE be resolved before P vs NP?

Sort by:

How will this market resolve if ZFC is shown to be inconsistent?

N/A

To make sure, by "solvable" you mean it is possible to either prove or refute it in ZFC?

@VanessaKosoy yes

People are also trading

+5% 1d12% chance

What is the complexity theoretic status of P vs NP, ETH, and Graph Isomorphism?

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

Will P vs NP be resolved by 2043?

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

+4% 1d6% chance

Will P vs NP be proven to be solvable by the end of 2030?

-4% 1d35% chance

Can NP-complete problems be solved in polynomial time?

When will someone successfully solve P vs NP?

When will P=NP Problem be solved or proved not solvable?

Will P vs PSPACE be resolved before P vs NP?

Related questions

What is the complexity theoretic status of P vs NP, ETH, and Graph Isomorphism?

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

Will P vs NP be resolved by 2043?

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

Will P vs NP be proven to be solvable by the end of 2030?

Can NP-complete problems be solved in polynomial time?

When will someone successfully solve P vs NP?

When will P=NP Problem be solved or proved not solvable?

Will P vs PSPACE be resolved before P vs NP?