## Contact Info

Pure MathematicsUniversity of Waterloo

200 University Avenue West

Waterloo, Ontario, Canada

N2L 3G1

Departmental office: MC 5304

Phone: 519 888 4567 x33484

Fax: 519 725 0160

Email: puremath@uwaterloo.ca

Tuesday, September 16, 2014 — 3:30 PM EDT

The class of abelian groups is somewhat well-behaved from the perspective of computability theory, since the theory of abelian groups is decidable. This implies, for example, that the word problem for finitely generated abelian groups is decidable. In this seminar, we survey basic definitions and theorems in abelian group theory and computable model theory, in order to state the main problems in computable abelian group theory. We define what it means for an abelian group to have a computable or computably enumerable presentation, and raise questions about the structure of such groups. We also discuss questions about the algorithmic complexity of isomorphisms between computable abelian groups and the complexity of the problem of whether an isomorphism exists.

Location

MC - Mathematics & Computer Building

5046

200 University Avenue West

Waterloo, ON N2L 3G1

Canada

200 University Avenue West

Waterloo, ON N2L 3G1

Canada

University of Waterloo

200 University Avenue West

Waterloo, Ontario, Canada

N2L 3G1

Departmental office: MC 5304

Phone: 519 888 4567 x33484

Fax: 519 725 0160

Email: puremath@uwaterloo.ca

University of Waterloo

University of Waterloo

43.471468

-80.544205

200 University Avenue West

Waterloo,
ON,
Canada
N2L 3G1