Abstract
We discuss conceptual limitations of generic learning algorithms acting in a competitive environment, and demonstrate that they are subject to constraints that are analogous to the constraints on knowledge imposed by the famous theorems of Gödel, Church and Turing.
Abstract (translated)
URL
https://arxiv.org/abs/2011.12728