论文标题

满足此定义的AI定义和程序

The AI Definition and a Program Which Satisfies this Definition

论文作者

Dobrev, Dimiter

论文摘要

我们将考虑代理商的所有政策,并证明其中之一是表现最好的政策。尽管该策略不可计算,但确实存在可计算的策略。我们将AI定义为一种可计算的策略,足以靠近最佳性能策略。在定义代理商最佳绩效政策之前,我们需要一种语言来描述世界。我们还将使用此语言来开发满足AI定义的程序。该程序将首先通过以选定的语言描述世界来理解世界。然后,该程序将使用该描述来预测未来并选择最佳动作。尽管该程序效率极低且实际上是无法使用的,但可以通过完善描述世界的语言和用于预测未来的算法来改进它。这可以产生一个既有效又与AI定义一致的程序。

We will consider all policies of the agent and will prove that one of them is the best performing policy. While that policy is not computable, computable policies do exist in its proximity. We will define AI as a computable policy which is sufficiently proximal to the best performing policy. Before we can define the agent's best performing policy, we need a language for description of the world. We will also use this language to develop a program which satisfies the AI definition. The program will first understand the world by describing it in the selected language. The program will then use the description in order to predict the future and select the best possible move. While this program is extremely inefficient and practically unusable, it can be improved by refining both the language for description of the world and the algorithm used to predict the future. This can yield a program which is both efficient and consistent with the AI definition.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源