# Seminar - The Difficulty of Finding Isomorphisms

### School of Mathematics and Statistics Research Seminar

**Speaker:** Dr Dan Turetsky

**Time:**
Tuesday 14th November 2017 at 03:00 PM -
04:00 PM

**Location:**
AM106,
Alan McDiarmid 106

**Groups:**
"Mathematics"
"Statistics and Operations Research"

## Abstract

Given two isomorphic objects (rings, fields, linear orders, graphs, etc), how difficult is it to find an isomorphism between them? Does this relate to the internal structure of the objects? Does the answer vary for different classes of objects, e.g. linear orders vs graphs?

This will be a talk in computable model theory. I will introduce the necessary concepts to formalize the above questions, and I will explain some of my work in answering them.