BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.17.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CMSA
X-ORIGINAL-URL:https://cmsa.fas.harvard.edu
X-WR-CALDESC:Events for CMSA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20221106T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20231105T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20231016T163000
DTEND;TZID=America/New_York:20231016T173000
DTSTAMP:20251026T063911Z
CREATED:20240223T093426Z
LAST-MODIFIED:20251026T063911Z
UID:10002844-1697473800-1697477400@cmsa.fas.harvard.edu
SUMMARY:An exploration of infinite games—infinite Wordle and the Mastermind numbers
DESCRIPTION:Speaker: Joel D. Hamkins (Notre Dame and Oxford) \nTitle: An exploration of infinite games—infinite Wordle and the Mastermind numbers \nAbstract: Let us explore the nature of strategic reasoning in infinite games\, focusing on the cases of infinite Wordle and infinite Mastermind. The familiar game of Wordle extends naturally to longer words or even infinite words in an idealized language\, and Mastermind similarly has natural infinitary analogues. What is the nature of play in these infinite games? Can the codebreaker play so as to win always at a finite stage of play? The analysis emerges gradually\, and in the talk I shall begin slowly with some easy elementary observations. By the end\, however\, we shall engage with sophisticated ideas in descriptive set theory\, a kind of infinitary information theory. Some assertions about the minimal size of winning sets of guesses\, for example\, turn out to be independent of the Zermelo-Fraenkel ZFC axioms of set theory. Some questions remain open.
URL:https://cmsa.fas.harvard.edu/event/colloquium-101623/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Colloquium
ATTACH;FMTTYPE=image/png:https://cmsa.fas.harvard.edu/media/CMSA-Colloquium-10.16.2023.png
END:VEVENT
END:VCALENDAR