BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Denis Hirschfeldt (University of Chicago)
DTSTART:20200519T200000Z
DTEND:20200519T210000Z
DTSTAMP:20260404T131151Z
UID:CTA/4
DESCRIPTION:Title: <a href="https://stable.researchseminars.org/talk/CTA/4
 /">Minimal pairs in the generic degrees</a>\nby Denis Hirschfeldt (Univers
 ity of Chicago) as part of Computability theory and applications\n\n\nAbst
 ract\nGeneric computability is a notion of "almost everywhere computabilit
 y" that has been studied from a computability-theoretic perspective by sev
 eral authors following work of Jockusch and Schupp. It leads naturally to 
 a notion of reducibility\, and hence to a degree structure. I will discuss
  the construction of a minimal pair in the generic degrees\, which contras
 ts with Igusa's result that there are\nno minimal pairs for the similar no
 tion of relative generic computability. I will then focus on several relat
 ed questions that remain open.\n
LOCATION:https://stable.researchseminars.org/talk/CTA/4/
END:VEVENT
END:VCALENDAR