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:6a1116df3f16c
DTSTART;TZID=America/Toronto:20260528T133000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260528T150000
URL:https://uwaterloo.ca/pure-mathematics/events/computability-learning-sem
 inar-170
SUMMARY:Computability Learning Seminar
CLASS:PUBLIC
DESCRIPTION:BARBARA CSIMA\, UNIVERSITY OF WATERLOO\n\n_Priority Arguments i
 n Computability Theory_\n\nThis term\, Computability Learning Seminar will
  focus on Priority\nArguments. Priority Arguments are a common proof techn
 ique used in\nComputability Theory. A theorem is broken down to being equi
 valent to\na list of requirements. These requirements are given a priority
  order\,\nand a strategy is devised to meet all the requirements\, making 
 use of\nthe priority order. In the early days of the subject\, a big quest
 ion\n(Post’s Problem -1944) was whether there were any non-computable\nc
 omputably enumerable (c.e.) sets that were not Turing equivalent to\nthe h
 alting set. The solution\, from Friedberg (1957) and Muchnik\n(1956)\, was
  to construct a pair of Turing incomparable c.e. sets\,\nusing a finite in
 jury priority argument. In this first talk\, we will\nbegin our examinatio
 n of priority arguments by going through the proof\nof this theorem\, intr
 oducing definitions and reviewing notions from\nComputability Theory as ne
 eded along the way.\n\nMC 5403
DTSTAMP:20260523T025423Z
END:VEVENT
END:VCALENDAR