Is P vs NP solvable? | Manifold

Is P vs NP solvable?

24

1kṀ942

3000

68%

chance

1D

1W

1M

ALL

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

This question is managed and resolved by Manifold.

Get

1,000

to start trading!

Sort by:

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

@VanessaKosoy yes

Related questions

Can NP-complete problems be solved in polynomial time?

When will someone successfully solve P vs NP?

Will geometric complexity theory solve P vs NP?

Will P vs NP be resolved by the end of these years?

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

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

Will P vs PSPACE be resolved before P vs NP?

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

Will P vs NP be resolved by 2043?

Related questions

Can NP-complete problems be solved in polynomial time?

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

When will someone successfully solve P vs NP?

Will P vs PSPACE be resolved before P vs NP?

Will geometric complexity theory solve P vs NP?

Will P vs NP be resolved by the end of these years?

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

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

Will P vs NP be resolved by 2043?

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