Printable PDF
Department of Mathematics,
Department of Mathematics,
University of California San Diego
****************************
Analysis Seminar
Michael Yampolsky
University of Toronto
Computability and complexity of Julia sets
Abstract:
Informally speaking, a compact set in the plane is computable if there exists an algorithm to draw it on a screen with an arbitrarily high magnification. We investigate the question of computability of a Julia set of a quadratic polynomial and obtain some surprising answers. (joint work with Mark Braverman)
Host: Efim Zelmanov
May 1, 2007
10:30 AM
AP&M 6218
****************************
