On limitations of learning algorithms in competitive environments

11/25/2020

∙

by   Alexander Y Klimenko, et al.

∙

0

∙

share

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.