Will we be able to solve all NP problems in polynomial time by 2200? (any practical computation method, e.g. BPP, BQP)
One-OffCienciaTecnologíaManifold MarketsSin KYCDatos de resolución verificadosBien calibradoPronóstico comunitario actualNo 97.6%
Pronosticadores
15
Tipo de pregunta
binary
Metodología
Play-money forecasting platform
Tipo de fuente
Pronóstico
Datos de mercado
Actualizado hace 7 horas
Desactualizado25 nov 22, 2:19 UTC1 ene 01, 4:59 UTC
Tendencias
Reglas
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.
