# Computability Learning Seminar

Thursday, August 15, 2019 — 10:00 AM EDT

Michael Deveau, Department of Pure Mathematics, University of Waterloo

"Computability of Walker's Cancellation Theorem"

We discuss the effectivization of Walker's Cancellation Theorem in group theory, with a focus on uniformity. That is, if we have an indexed collection of instances of sums of finitely generated abelian groups $A_i \oplus G_i \cong A_i \oplus H_i$ and the codes for the isomorphisms between them, then we wish to know to what extent we can give a single procedure that, given an index $i$, produces an isomorphism between $G_i$ and $H_i$. We begin by examining Cohn's classical proof of the theorem and see how much of it is effective. We then show that in a certain case, we are able to show that no computable procedure can exist. We also exhibit some related open problems.

MC 5479

### August 2019

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