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
29
30
31
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
1
2
3
4
  1. 2023 (46)
    1. February (19)
    2. January (27)
  2. 2022 (179)
    1. December (8)
    2. November (31)
    3. October (24)
    4. September (17)
    5. August (9)
    6. July (15)
    7. June (14)
    8. May (13)
    9. April (14)
    10. March (15)
    11. February (12)
    12. January (7)
  3. 2021 (135)
  4. 2020 (103)
  5. 2019 (199)
  6. 2018 (212)
  7. 2017 (281)
  8. 2016 (335)
  9. 2015 (211)
  10. 2014 (235)
  11. 2013 (251)
  12. 2012 (135)