Title: Recursion Theory and Diophantine Approximation
by Theodore Slaman (UC Berkeley) as part of Computability theory and applications

Abstract
We will give a survey of some connections between Recursion Theory, especially Algorithmic Randomness, and Diophantine Approximation, especially normality and exponents of irrationality. We will emphasize what we view as the contribution of a recursion theoretic perspective.