## University COVID-19 update

### 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 seminar

Wednesday, September 17, 2014 — 3:40 PM EDT

## Barbara Csima, Department of Pure Mathematics, University of Waterloo

### “Isomorphisms of Computable Structures”

We say a structure is computable (or computably presented) if it has domain the natural numbers, and if all functions, relations and constants are uniformly computable. This definition is not isomorphism invariant. We can ask: between two computable copies of a given structure, what is this simplest isomorphism that must exist? For example, between any two computable copies of the rationals, there always exists a computableisomorphism, since the usual back-and-forth isomorphism can be found effectively. On the other hand, the difficulty of computing an isomorphism between two computable copies of (N, ¡) is exactly that of the halting set, since we need to answer the single- quantifier questions of which element is least, next, etc. In this talk, we present what is known about Turing degrees that arise as degrees of isomorphisms for computable structures.

Location
M3 - Mathematics 3
4206
200 University Avenue West

Waterloo, ON N2L 3G1

### March 2020

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