Title: Coding in the automorphism group of a structure
by Dan Turetsky (Victoria University of Wellington, New Zealand) as part of Computability theory and applications
In this talk I will discuss a new technique for coding a closed set into the automorphism group of a structure. This technique has applications to problems in Scott rank, effective dimension, and degrees of categoricity. For instance, I will explain how it can be used to construct a computably categorical structure with noncomputable Scott rank.