On limitations of learning algorithms in competitive environments

Alexander Y Klimenko, Dimitri A Klimenko

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\"odel, Church and Turing.

Knowledge Graph



Sign up or login to leave a comment