University COVID-19 update

The University of Waterloo is constantly updating our most Frequently Asked Questions.

Questions about buildings and services? Visit the list of Modified Services.

Please note: The University of Waterloo is closed for all events until further notice.

Logic SeminarExport this event to calendar

Tuesday, October 1, 2019 — 2:00 PM EDT

Matthew Harrison-Trainor, Victoria University of Wellington

"Introcomputability"

We say that a set A introcomputes a set B if every infinite subset of A computes B. There are two natural ways in which this can happen. First, if A consists of the finite initial segments of B, then A introcomputes B; and second, if B is hyperarithmetic and A is very sparse then every infinite subset of A computes a function dominating the modulus of B, and hence computes B. I’ll talk about a number of results attempting to understand the reasons that one set might introcompute another.

MC 5413

S M T W T F S
27
28
29
30
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
  1. 2021 (67)
    1. July (17)
    2. June (15)
    3. May (1)
    4. April (4)
    5. March (11)
    6. February (9)
    7. January (10)
  2. 2020 (103)
    1. December (10)
    2. November (12)
    3. October (4)
    4. September (3)
    5. August (1)
    6. July (5)
    7. June (1)
    8. May (3)
    9. March (16)
    10. February (26)
    11. January (22)
  3. 2019 (199)
  4. 2018 (212)
  5. 2017 (281)
  6. 2016 (335)
  7. 2015 (211)
  8. 2014 (235)
  9. 2013 (251)
  10. 2012 (135)