# Computability and complexity in analysis and dynamics

 Computer Science/Discrete Mathematics Seminar II Topic: Computability and complexity in analysis and dynamics Speaker: Mark Braverman Affiliation: Princeton University; von Neumann Fellow, School of Mathematics Date: Tuesday, April 4 Time/Room: 10:30am - 12:30pm/S-101

We will give a high-level overview of computable analysis---an area studying the computational properties of continuous objects such as functions and measures on $\mathbb R^d$. We will then discuss some applications to the computability and complexity of objects in dynamical systems, such as Julia sets of complex polynomials and the ergodic measure of a map in $\mathbb R^d$.