Dr S.A. Terwijn (Sebastiaan)

Mathematical logic, theoretical computer science, in particular computability and complexity theory. Topics I have worked on include: algorithmic randomness, Kolmogorov complexity, generic sets, measure theory and Hausdorff dimension, proof theory, algebraic logic, computational learning theory, hidden Markov models, probabilistic logic, Mededev and Muchnik degrees, lambda calculus and combinatory algebra, and information theory.