OptionProbability
At least one of the six left Millennium problems is found with a counter-example
At least one of the six left Millennium problems is undecidable
A unified framework for gravitation and quantum theory is proposed that is not string theory
Neural Networks are explainable and can be trained without gradient descent with better performance.
No AI will be powerful enough to directly (as a necessary condition) lead to a significant discovery in math.
Shinichi Mochizuki is right or almost right about abc conjecture
P vs. NP will be trivial (i.e., provable using simple methods taught in undergrad classes, e.g., with a counter-example)
70
43
37
25
20
13
OptionVotes
NO
YES
347
171
189
53
Other
Simulating Time With Square-Root Space
MIP* = RE
The Complexity of Gradient Descent: CLS = PPAD ∩ PLS
Graph Isomorphism in Quasipolynomial Time
A Dichotomy Theorem for Nonuniform CSPs
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits
An Average-Case Depth Hierarchy Theorem for Boolean Circuits
Learning Algorithms from Natural Proofs
Deciding Parity Games in Quasi-polynomial Time
A Proof of the CSP Dichotomy Conjecture
Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture
36
18
5
110
75
