Aviso de calidad de datosDatos obsoletos
Datos del 26 oct 2026, 13:22 UTC · política pm-quality-4
Pronóstico comunitario actual
Sí 75.4%
Pronosticadores
10
Tipo de pregunta
binary
Metodología
Play-money forecasting platform
Tipo de fuente
Pronóstico
Datos de mercado
Actualizado ayer
Desactualizado1 ago 26, 16:22 UTC1 ene 35, 15:59 UTC
Tendencias
Reglas
An AI program writes a correct proof that the Riemann hypothesis is either true, false, or undecidable (within the axioms of complex analysis) before 2035.
- Criteria for YES:
- (1) The proof must be vetted and approved by qualified humans in the same way that any paper would be checked for publication.
- The method for verifying the proof must be acceptable to the editors of the Annals of Mathematics or an equivalently prestigious journal.
- This means that if the editors of the Annals think it is okay for humans to use a computer to check the proof, then that's fine.
- (2) The proof must primarily be the work of the AI.
