Mathematics is the first place where evidence of AI superintelligence is likely to appear, theoretical computer scientist Sanjeev Arora says. For the Communications of the Association for Computing Machinery (ACM) I wrote about his ideas.
“Will there be a superhuman AI mathematician?” asked theoretical computer scientist professor Sanjeev Arora from Princeton University at the 12th Heidelberg Laureate Forum this September. Well, what would that mean? Imagine the set of all possible math theorems. Only a subset has been proven by human mathematicians. Arora: “A superhuman AI mathematician is one that can prove more theorems than humans have.”
Arora, who won the 2011 ACM Prize in Computing, sketched a possible path to a superhuman AI mathematician. He explained that the idea traces back to David Hilbert’s early 20th-century dream of automating mathematics. That dream was crushed by the work of Gödel, Turing, and Church, yet it left behind something lasting: the concept of formal proof verification — the notion that mathematical proofs can be written in a precise language and then rigorously checked by a computer.
The modern open-source programming language and proof assistant Lean is ideally suited for precisely this purpose, Arora told. A proof written in English can be translated into Lean after which the Lean checker verifies whether or not the proof is correct. Arora: “Rewriting the proof in Lean is presently done by humans, but very soon this will be done by AI.”
The whole article can be read on the ACM website.