printable pdf
比利时vs摩洛哥足彩
,
比利时vs摩洛哥足彩
,
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
****************************
