BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Andrew DeLapo (University of Connecticut)
DTSTART:20250213T190000Z
DTEND:20250213T200000Z
DTSTAMP:20260423T052929Z
UID:OLS/168
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/OLS/168/">In
 dex Sets and Computable Categoricity of CSC Spaces</a>\nby Andrew DeLapo (
 University of Connecticut) as part of Online logic seminar\n\n\nAbstract\n
 Given a topology on the natural numbers\, how complicated is it to describ
 e? To answer this question with tools from computability theory\, we will 
 restrict to the context of countable second-countable (CSC) topological sp
 aces. One approach is to assign an index to each computable CSC space and 
 determine the arithmetic complexity of the set of CSC spaces with some pro
 perty. Another approach comes from computable structure theory\; for examp
 le\, given two computable copies of a CSC space\, does there exist a compu
 table homeomorphism between them? In this talk\, we will explore these app
 roaches and apply them in three running examples: the indiscrete\, discret
 e\, and initial segment topologies.\n
LOCATION:https://researchseminars.org/talk/OLS/168/
END:VEVENT
END:VCALENDAR