Rabin, M.O, (1957): "Effective Computability of Winning Strategies", Annals of Mathematics Studies, Vol. 3, No. 39, ed. by M. Dresher, A.W.  Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Computability and Complexity in Games - Vela Velupillai (Correct)
....of being played by an automaton. Charles Babbage 1 1. Introduction. there are games in which the players who in theory can always win cannot do so in practice because it is impossible to supply him with effective instructions regarding how he should play in order to win. Rabin, 1957, p. 148; italics added. The above is a statement of the first important result in what I have come to call computable economics. The key word in Rabin s quote is effective. In this paper I aim to discuss the question of effective playability and the computational and diophantine complexity of ....
Rabin, M.O, (1957): "Effective Computability of Winning Strategies", Annals of Mathematics Studies, Vol. 3, No. 39, ed. by M. Dresher, A.W.
Combinatorial Game Theory Foundations Applied to Digraph Kernels - Fraenkel (1997) (2 citations) (Correct)
No context found.
M. O. Rabin [1957], Effective computability of winning strategies, Contributions to the Theory of Games vol. 3, Ann. of Math. Stud. 39, 147--157, Princeton.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC