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.

翻译：我们讨论通用学习算法在竞争环境中运作的概念局限性,并表明它们受到与G\"odel、教会和图灵著名的理论对知识的限制相似的限制。