Computability theory is the area of mathematical logic dealing with the theoretical
bounds on, and structure of, computability and with the interplay between computability
and definability in mathematical languages and structures.

Modern computability theory has many areas of research and specialization. Pure
computability theory studies various structural properties of sets under Turing and
other reducibilities. Reverse Mathematics uses ideas from computability to quantify
the axiomatic strength of various mathematical theorems. Computable structure theory
examines the (relative) computational complexity of various mathematical objects,
and analyses to what extent computability theoretic properties of an object stem from
structural properties of the object. Algorithmic randomness uses tools from computability
theory to define various notions of random individual objects. All these notions have,
in turn, many applications to other areas of computability theory.

This workshop aims to bring together researchers from all areas of Computability
Theory, at any stage of their career, for an intense week of collaboration.

Organizers:

- Laurent Bienvenu (CNRS & Université de Montpellier)

- Peter Cholak (University of Notre Dame)

- Barbara Csima (University of Waterloo)

- Matthew Harrison-Trainor (University of Waterloo)

Contact: cta-waterloo[at]sciencesconf.org