Theodore Slaman is a Professor in the Berkeley Mathematics Department, where he has been on the faculty since 1996.  He works in Mathematical Logic, with a special interest in computability and definability in arithmetic, with applications to algorithmic randomness, subsystems of first and second order arithmetic, computable structure theory and diophantine approximation.