Abstract
We show that there exist real parameters $$c\in (-2,0)$$ for which the Julia set $$J_{c}$$ of the quadratic map $$z^{2} + c$$ has arbitrarily high computational complexity. More precisely, we show that for any given complexity threshold T(n), there exist a real parameter c such that the computational complexity of computing $$J_{c}$$ with n bits of precision is higher than T(n). This is the first known class of real parameters with a non-poly-time computable Julia set.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
