Hamkins: The theory of infinite games, with examples, including infinite chess

YESHIVA MATH/PHIL CLUB
The theory of infinite games, with examples, including infinite chess
Joel David Hamkins (CUNY)
Tuesday, April 30, 2013 5:45 pm
Furst Hall, Amsterdam Ave. & 185th Street, Yeshiva University

Abstract. I will give a general introduction to the theory of infinite games, suitable for mathematicians and philosophers. What does it mean to play an infinitely long game? What does it mean to have a winning strategy for such a game? Is there any reason to think that every game should have a winning strategy for one player or another? Could there be a game, such that neither player has a way to force a win? Must every computable game have a computable winning strategy? I will present several game paradoxes and example infinitary games, including an infinitary version of the game of Nim, and several examples from infinite chess.

Leave a Reply

Please log in using one of these methods to post your comment:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )

Connecting to %s