Veri kalitesi uyarısıKaynak verileri bozulmuş
26 Eki 2026 13:22 UTC itibarıyla veriler · politika pm-quality-4
Güncel topluluk tahmini
Evet 75.4%
Tahminciler
10
Soru türü
binary
Yöntem
Play-money forecasting platform
Kaynak türü
Tahmin
Piyasa verileri
1 saat önce güncellendi
Gecikmeli1 Ağu 26 16:22 UTC1 Oca 35 15:59 UTC
Trendler
Kurallar
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.
