Poly-time Computability of the Feigenbaum Julia set
arXiv:1404.1236 · doi:10.1017/etds.2015.24
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.