Güncel topluluk tahmini
Hayır 97.6%
Tahminciler
15
Soru türü
binary
Yöntem
Play-money forecasting platform
Kaynak türü
Tahmin
Piyasa verileri
7 saat önce güncellendi
Guncelligini yitirmis25 Kas 22 02:19 UTC1 Oca 01 04:59 UTC
Trendler
Kurallar
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.
