Almost every real quadratic polynomial has a poly-time computable Julia set

2017/02/19 by Dudko, Artem, Yampolsky, Michael · 2 citations
#Dynamical Systems (math.DS) #FOS: Mathematics

paper · doi:10.48550/arxiv.1702.05768

Abstract

We prove that Collet-Eckmann rational maps have poly-time computable Julia sets. As a consequence, almost all real quadratic Julia sets are poly-time.

Cited by

• A dynamical algorithm to compute hyperbolic Julia sets in polynomial time
• Computability for Axiom A Polynomial Skew Products of ℂ²

Related

• Real quadratic Julia sets can have arbitrarily high complexity
• Computability of Julia sets
• Computability of the Julia set. Nonrecurrent critical orbits
• Non-computable Julia sets
• A dynamical algorithm to compute hyperbolic Julia sets in polynomial time