When:

December 7, 2017 @ 2:55 pm – 3:45 pm

2017-12-07T14:55:00-10:00

2017-12-07T15:45:00-10:00

Where:

Keller 402

Speaker : Michael Yampolsky (University of Toronto)

Title : Computability of Julia sets.

Abstract : Informally speaking, a compact set in the plane is computable if there exists an algorithm to draw it on a computer screen with an arbitrary resolution. Julia sets are some of the best-known mathematical images, however, the questions of their computability and computational complexity are surprisingly subtle. I will survey joint results with M. Braverman and others on computability and complexity of Julia sets.