Computability Learning SeminarExport this event to calendar

Thursday, May 30, 2019 — 10:00 AM EDT

Michael Deveau,  Department of Pure Mathematics, University of Waterloo

"Computability Theory and Some Applications"

This is an extremely high level overview of the material that makes up my thesis. We explore degrees of categoricity that are computably enumerable in $\mathbf{0}^{(\alpha)}$ for $\alpha$ a limit ordinal and investigate the utility of coding the degree of isomorphisms using unary relations. We then answer the question of effectiveness of Walker's Cancellation Theorem for abelian groups. Finally, we show several results related to the bounded jump on the bounded Turing degrees.

MC 5479

S M T W T F S
26
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
2
3
4
5
6
  1. 2021 (97)
    1. October (10)
    2. September (5)
    3. August (15)
    4. July (17)
    5. June (15)
    6. May (1)
    7. April (4)
    8. March (11)
    9. February (9)
    10. 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)