BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6a4d9777bfe42
DTSTART;TZID=America/Toronto:20260709T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260709T150000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-176
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:MICHAEL GREGORY\, UNIVERSITY OF WATERLOO\n\n_The Complexity of 
 the Isomorphism Problem for Finitely Generated\nAlgebras_\n\nWe review the
  arithmetic hierarchy and use it to analyze the\nisomorphism problem for f
 initely generated c.e. algebras. We introduce\nthe ascending chain conditi
 on (ACC) on congruences and explain how it\nrestricts the complexity of is
 omorphism. We show that any finitely\ngenerated c.e. algebra whose congrue
 nce lattice satisfies ACC has\na \\(\\Pi_2\\) isomorphism problem. Then\,
  we prove that the\nclass \\(UF_2\\) of algebras with two unary operation
 s has\n\\(\\Sigma_3\\)-complete isomorphism problem.\n\nMC 5403
DTSTAMP:20260708T001903Z
END:VEVENT
END:VCALENDAR