BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Yue Yang (National University of Singapore)
DTSTART:20220215T010000Z
DTEND:20220215T020000Z
DTSTAMP:20260423T004914Z
UID:CTA/76
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CTA/76/">Str
 ong minimal pair problem</a>\nby Yue Yang (National University of Singapor
 e) as part of Computability theory and applications\n\n\nAbstract\nThis ta
 lk is about recursively enumerable (r.e.) Turing degrees. We say that two 
 nonzero r.e. degrees a and b form a strong minimal pair\, if a ∧ b = 0 a
 nd for any nonzero r.e. degree x ≤ a\, b ∨ x ≥ a. Joint with Mingzho
 ng Cai\, Yiqun Liu\, Yong Liu\, and Cheng Peng\, we are able to show the n
 onexistence of such a pair. I will not make any attempt to outline the pro
 of. Instead\, I plan to talk about our result in relation to earlier ones 
 in the literature\, and mention a few interesting (or strange) features of
  the construction. For instance\, the construction is highly nonuniform\, 
 we have to prepare three different (families of) sets and one of them will
  win. Furthermore\, the index of the winning set can only be found using 0
 ^(4). I will also make some comments about the priority methods in general
  and raise some questions hoping to hear suggestions from the audiences.\n
LOCATION:https://researchseminars.org/talk/CTA/76/
END:VEVENT
END:VCALENDAR