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

  Browse A-Z

Log in

Cambridge users (raven)details Other usersdetails No account?details

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

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.

Other lists

Computational Biology Workshop 2017 Humanitas lectures The George Macaulay Trevelyan Lectures 2012

Other talks

Networks, resilience and complexity Cosmological Probes of Light Relics Magnetic Resonance on Two Scales for Research into Cell Cycle and Stroke Future of Games in Engineering Education Develop a tool for inferring symptoms from prescriptions histories for cancer patients International Women's Day Lecture 2018: Press for Progress by Being an Active Bystander Direct measurements of dynamic granular compaction at the mesoscale using synchrotron X-ray radiography Single Cell Seminars (September) Single Cell Seminars (November) PTPmesh: Data Center Network Latency Measurements Using PTP Access to Medicines
 

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