Poly-time Computability of the Feigenbaum Julia set
Dynamical Systems
2015-07-29 v1
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.
Keywords
Cite
@article{arxiv.1404.1236,
title = {Poly-time Computability of the Feigenbaum Julia set},
author = {Artem Dudko and Michael Yampolsky},
journal= {arXiv preprint arXiv:1404.1236},
year = {2015}
}