Micahel Yampolsky: Computability of Julia sets (joint work with Mark Braverman)
Abstract:
Informally speaking, a planar compact is computable, if there exists an algorithm to visualize it. In a series of papers we have settled most of the questions on computability of polynomial Julia sets. Some of the answers are quite surprising.