Is P vs NP solvable? | Manifold

Is P vs NP solvable?

Plus

21

Ṁ657

3000

65%

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

and

3.00

Sort by:

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

Related questions

Will P vs PSPACE be resolved before P vs NP?

Will P vs NP be resolved by 2043?

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

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

Is normal-play dots-and-boxes PSPACE-complete (YES) or in NP (NO)?

Will AI resolve P vs NP by 2050?

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

When will someone successfully solve P vs NP?

Will geometric complexity theory solve P vs NP?

Related questions

Will P vs PSPACE be resolved before P vs NP?

Will P vs NP be resolved by 2043?

Will AI resolve P vs NP by 2050?

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

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

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

When will someone successfully solve P vs NP?

Is normal-play dots-and-boxes PSPACE-complete (YES) or in NP (NO)?

Will geometric complexity theory solve P vs NP?

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