Poly-time Computability of the Feigenbaum Julia set
  We present the first example of a poly-time computable Julia set with a recurrent critical point: we prove that the Julia set of the Feigenbaum map is computable in polynomial time. 
Artem Dudko and Michael Yampolsky
math.DS