论文标题
在竞争环境中学习算法的局限性
On limitations of learning algorithms in competitive environments
论文作者
论文摘要
我们讨论了在竞争环境中追求对抗目标的通用学习算法的概念局限性，并证明它们受到类似于Gödel和Turing著名定理所施加的知识的限制的局限性。这些局限性被证明与不强制性有关，这种局限性通常存在于竞争环境中。
We discuss conceptual limitations of generic learning algorithms pursuing adversarial goals in competitive environments, and prove that they are subject to limitations that are analogous to the constraints on knowledge imposed by the famous theorems of Gödel and Turing. These limitations are shown to be related to intransitivity, which is commonly present in competitive environments.
