Will we be able to solve all NP problems in polynomial time by 2200? (any practical computation method, e.g. BPP, BQP)
One-OffWetenschapTech
Manifold MarketsGeen KYCGeverifieerde afwikkelingsgegevensGoed gekalibreerdHuidige gemeenschapsvoorspelling
Nee 97.6%
Nee 97.6%Voorspellers
15
Vraagtype
binary
Methodologie
Play-money forecasting platform
Brontype
Voorspelling
Marktdata
Bijgewerkt 9 uur geleden
Verouderd25 nov 22, 02:19 UTC1 jan 01, 04:59 UTC
Trends
Regels
Resolves YES if by 2200 humanity has the demonstrated capability to solve all NP problems in worst-case polynomial time, with error probability bounded by a constant.
- Otherwise resolves NO.
- If you know about complexity classes: this means P = NP is sufficient but not necessary.
- BPP = NP (randomized algorithms with constant error probability) would be sufficient, and BQP = NP (quantum algorithms) would also be sufficient if the relevant algorithms could actually be run practically on quantum computers.
- Other methods could also be sufficient if they meet the resolution criteria.
- Any method of computation is allowed for this question, as long as humans can actually do it practically and at reasonable scale.
