Gunnar Wilken
A short introduction to Patterns of Resemblance
Abstract:
Elementary patterns of resemblance were discovered and
first investigated by Tim Carlson. I will give an idea of their
basic nature and describe some of my contributions, leading
me to a conjecture on strong patterns of order 2.

(Uri Andrews and) Julia Knight
Strongly minimal theories with computable models
Abstract:
We give effectiveness conditions on a strongly minimal theory $T$ guaranteeing that all models have computable copies. In particular, we show that if $T$ is a strongly minimal and $T \cap \exists_{n+3} is $\Delta^{0}_{n}$ uniformly in $n$, then every model has a computable copy. In particular, we answer a long-standing question in
computable model theory by showing that if some model of a strongly minimal
theory is recursive, then every model is arithmetical; in fact, every model has a
copy recursive in $\emptyset^{(4)}$.

Valentina Harizanov
Effective Categoricity of Injection Structures
Abstract:
We study computability-theoretic properties of computable injection structures and the complexity of isomorphisms between these structures. An injection structure is a structure $\mathcal{A} = (A; f )$ with a single unary $1$--$1$ function $f$. The orbit of $a \in A$ is $\mathcal{O}_{f}(a) = \{ b \in A : ( \exists n \in  \mathbb{N} )[f^{n}(a) = b \lor f^{n}(b) = a ] \} $. We prove that a computable injection structure is computably categorical if and only if it has finitely many infinite orbits. A computable injection structure is $ \Delta^{0}_{2}$-categorical if and only if it has finitely many orbits of type $ \omega $ or finitely many orbits of type $Z$. Furthermore, every computably categorical injection structure is relatively computably categorical, and every $ \Delta^{0}_{2}$-categorical injection structure is relatively $ \Delta^{0}_{2}$-categorical. We also establish various index set results. The index set of infinite computably categorical injection structures is a $\Sigma^{0}_{3}-complete set. The index set of infinite $\Delta^{0}_{2}$-categorical injection structure is a $\Sigma^{0}_{4}$-complete set. This is joint work with Doug Cenzer and Jeff Remmel.

Andre Nies
Metric spaces and computability theory
Abstract:
We study similarity of Polish metric spaces. We consider the Scott rank, both for classical and for continuous logic. The former is connected to isometry, the latter to having Gromov-Hausdorff distance zero. In the computable setting, we show that any two isometric compact metric spaces are $ \Delta^{0}_{3} $ isometric.
The various projects we review are joint with many researchers,
among them Sy Friedman, Fokina and Koerwien; Ben Yaacov and
Tsankov; Melnikov.