SOME NOTES ON CHURCH THESIS AND THE THEORY OF GAMES

被引：23

作者：

ANDERLINI, L

机构：

[1] St. John's College, Cambridge

来源：

THEORY AND DECISION | 1990年 / 29卷 / 01期

关键词：

Church's thesis; knowledge operator; normal-form games; rational players; recursive functions; recursive sets; set of rational players; Turing machines;

D O I：

10.1007/BF00134103

中图分类号：

F [经济];

学科分类号：

02 ;

摘要：

This paper considers games in normal form played by Turing Machines. The machines are fed as input all the relevent information and then are required to play the game. Some 'impossibility' results are derived for this set-up. In particular, it is shown that no Turing Machine exists which will always play the correct strategy given its opponent's choice. Such a result also generalizes to the case in which attention is restricted to economically optimizing machines only. The paper also develops a model of knowledge. This allows the main results of the paper to be interpreted as stemming out of the impossibility of always deciding whether a player is rational or not in some appropriate sense. © 1990 Kluwer Academic Publishers.

引用

页码：19 / 52

页数：34