BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Sarah Reitzes (University of Chicago)
DTSTART:20200623T200000Z
DTEND:20200623T210000Z
DTSTAMP:20260423T004820Z
UID:CTA/10
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CTA/10/">Red
 uction games\, provability\, and compactness</a>\nby Sarah Reitzes (Univer
 sity of Chicago) as part of Computability theory and applications\n\n\nAbs
 tract\nIn this talk\, I will discuss joint work with Damir D. Dzhafarov an
 d Denis R. Hirschfeldt. Our work centers on the characterization of proble
 ms P and Q such that P is omega-reducible to Q\, as well as problems\n P a
 nd Q such that RCA_0 proves Q implies P\, in terms of winning strategies i
 n certain games. These characterizations were originally introduced by Hir
 schfeldt and Jockusch. I will discuss extensions and generalizations of th
 ese characterizations\, including\n a certain notion of compactness that a
 llows us\, for strategies satisfying particular conditions\, to bound the 
 number of moves it takes to win. This bound is independent of the instance
  of the problem P being considered.\n
LOCATION:https://researchseminars.org/talk/CTA/10/
END:VEVENT
END:VCALENDAR