Friday, February 6, 20154:50 pmGC 4102 (Science Center)

# Computability, computational complexity and geometric group theory

## Paul Schupp

### University of Illinois at Urbana-Champaign

The three topics in the title have been inextricably linked since the famous 1912 paper of Max Dehn. In recent years the asymptotic-generic point of view of geometric group theory has given rise to new areas of computability and computational complexity. I will discuss how this arose and then focus on one recent development in computability theory, namely, coarse computability and the coarse computability bound.