Not all mathematical questions can be resolved, according to Gödel’s famous incompleteness theorems. It turns out that machine learning can be vulnerable to undecidability too, as is illustrated with an example problem where learnability cannot be proved nor refuted.
- Shai Ben-David
- Pavel Hrubeš
- Amir Yehudayoff
