Computability Theory Learning SeminarExport this event to calendar

Thursday, November 24, 2022 — 10:30 AM EST

Xinyue (Cynthia) Xie & Layth Al-Hellawi, Department of Pure Mathematics, University of Waterloo

"Effectiveness properties of the Walker's Cancellation Theorem - Part III"

This is part III of a series of 4 talks in which we present and build upon the work in Deveau's PhD thesis and examine Walker's Cancellation Theorem from a computability theory perspective. In this talk, we will present a stronger version of Deveau's Theorem 4.1. Deveau's Theorem 4.1 states that given groups E:= A ⊕ G = B ⊕ H, where A ≅ B are cyclic with known generators, G and H are always computably isomorphic with some isomorphism f. Furthermore, if A and B are known to be finite, then f can be constructed uniformly in the indices of the groups. We will prove that regardless of the cardinality of A and B, the function that computes f is Turing reducible to the halting set. The notions of Turing reducibility, Turing degree and the Turing jump operator will be introduced.

MC 5417

Event tags 

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