Infinite chess: the mate-in-n problem is decidable and the omega-one of chess
Duration: 32 mins 45 secs
Share this media item:
Embed this media item:
Embed this media item:
About this item
| Description: |
Hamkins, JD (City University of New York)
Thursday 22 March 2012, 16:00-16:30 |
|---|
| Created: | 2012-03-29 17:44 |
|---|---|
| Collection: | Semantics and Syntax: A Legacy of Alan Turing |
| Publisher: | Isaac Newton Institute |
| Copyright: | Hamkins, JD |
| Language: | eng (English) |
Available Formats
| Format | Quality | Bitrate | Size | |||
|---|---|---|---|---|---|---|
| MPEG-4 Video | 640x360 | 1.85 Mbits/sec | 454.53 MB | View | Download | |
| WebM | 640x360 | 770.25 kbits/sec | 184.85 MB | View | Download | |
| Flash Video | 484x272 | 568.7 kbits/sec | 136.41 MB | View | Download | |
| iPod Video | 480x270 | 506.05 kbits/sec | 121.45 MB | View | Download | |
| MP3 | 44100 Hz | 125.03 kbits/sec | 29.87 MB | Listen | Download | |
| Auto * | (Allows browser to choose a format it supports) | |||||