Current community forecast
Yes 75.4%
Forecasters
10
Question type
binary
Methodology
Play-money forecasting platform
Source type
Forecast
Market data
Updated 20 hours ago
StaleAug 1, 26, 4:22 PM UTCJan 1, 35, 3:59 PM UTC
Trends
Rules
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.
