Institute for Mathematical Sciences
Artem Dudko, Michael Yampolsky
Poly-time computability of the Feigenbaum Julia set
Abstract: 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.
View ims14-02 (PDF format)