Computability Theory Learning Seminar

Joey Lakerdas-Gayle, Department of Pure Mathematics, University of Waterloo

"Degree spectra of computable structures - Part II"

The isomorphism spectrum of a pair of isomorphic computable structures is the set of Turing degrees that compute an isomorphism between the structures. The categoricity spectrum of a computable structure is the set of Turing degrees that compute an isomorphism between every pair of computable copies of the structure. We will investigate some properties of these spectra and give some examples.

MC 5403