BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Dino Rossegger (Technische Universität Wien)
DTSTART:20231019T180000Z
DTEND:20231019T190000Z
DTSTAMP:20260423T021234Z
UID:OLS/134
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/OLS/134/">Le
 arning equivalence relations</a>\nby Dino Rossegger (Technische Universit
 ät Wien) as part of Online logic seminar\n\n\nAbstract\nWhat does it mean
  for an equivalence relation on a Polish space to be\nlearnable? Motivated
  by the recent work of Fokina\, Kötzing\, and San\nMauro\, who formulated
  a framework to learn the isomorphism relation on\ncountable classes of st
 ructures\, we introduce frameworks that aim to\ngive a formal notion of le
 arnability for equivalence relations on Polish\nspaces. Our main results c
 haracterize learnability in these frameworks\nvia the descriptive complexi
 ty of the equivalence relations\, and\, using\ntechniques from higher recu
 rsion theory and effective descriptive set\ntheory\, we calculate the comp
 lexity of the class of learnable\nequivalence relations. At last\, we disc
 uss the learnability of\nequivalence relations arising naturally in comput
 ability theory.\nThis is joint work with Ted Slaman and Tomasz Steifer.\n
LOCATION:https://researchseminars.org/talk/OLS/134/
END:VEVENT
END:VCALENDAR