University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Infinite chess: the mate-in-n problem is decidable and the omega-one of chess

Infinite chess: the mate-in-n problem is decidable and the omega-one of chess

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Mustapha Amrani.

Semantics and Syntax: A Legacy of Alan Turing

2012/03/22

This talk is part of the Isaac Newton Institute Seminar Series series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2024 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity