Computation theory has been of central interest to logicians since the 1930`s when through
the fundamental work of A. Turing, K. Gödel, A. Church, S. Kleene and others the
appropriate mathematical model (Turing machine) was established. A general computability
theory emerged that classifies problems according to their ``degrees of undecidability``. The
aim of this project is to investigate the theory of computation and its generalisation to a
theory of definability in collaboration with the Novosibirsk logic group. We aim to study
computability and definability in the context of model theory and descriptive set theory, with
an emphasis on properties of computable structures.