BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.15.17//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
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: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
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20250309T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20241202T163000
DTEND;TZID=America/New_York:20241202T173000
DTSTAMP:20260405T073220
CREATED:20240903T195308Z
LAST-MODIFIED:20241126T142827Z
UID:10003440-1733157000-1733160600@cmsa.fas.harvard.edu
SUMMARY:Computability on $\mathbb R$ and other continuum-size structures
DESCRIPTION:Colloquium \nSpeaker: Russell Miller\, CUNY \nTitle: Computability on $\mathbb R$ and other continuum-size structures \nAbstract: We begin by recalling the notion of a computable function on the real numbers $\mathbb R$\, developed independently by Gregorczyk and Lacombe over sixty years ago. Using this notion\, we note that the real numbers that are themselves computable form a countable subfield of $\mathbb R$ with exactly the same first-order properties as $\mathbb R$ itself. (Logicians would therefore call it an \emph{elementary subfield}.) So\, in a first-order sense\, everything that happens in $\mathbb R$ is already exemplified in this much nicer subfield. However\, even when one knows that an existential statement holds for all parameters\, it may be impossible (both in $\mathbb R$ and in the subfield) to give a computable procedure for producing witnesses. Similar results hold in $\mathbb C$. \nWe will then turn to a different continuum-sized structure: the absolute Galois group $\operatorname{Gal}(\mathbb Q)$ of the rational numbers. Once again the computable elements of this group form a subgroup\, but now it is an open problem whether the group and the subgroup have the same first-order theory\, let alone whether this is an elementary subgroup. (If they do have the same theory\, this would put nice upper bounds on the complexity of the theory of $\operatorname{Gal}(\mathbb Q)$.) However\, using joint work with Kundu\, we can show that once again there is no computable procedure for producing witnesses to the truth of (true) existential statements\, either in the full group or in the subgroup.
URL:https://cmsa.fas.harvard.edu/event/colloquium-12224/
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-12.2.2024.png
END:VEVENT
END:VCALENDAR