Filled Julia sets with empty interior are computable
From MaRDI portal
Abstract: We show that if a polynomial filled Julia set has empty interior, then it is computable.
Recommendations
Cited in
(16)- Statistical properties of dynamical systems -- Simulation and abstract computation
- On computational complexity of Cremer Julia sets
- Is the Mandelbrot set computable?
- Computability of topological pressure on compact shift spaces beyond finite type*
- Almost every real quadratic polynomial has a poly-time computable Julia set
- Non computable Mandelbrot-like sets for a one-parameter complex family
- Computable Geometric Complex Analysis and Complex Dynamics
- Non-computable impressions of computable external rays of quadratic polynomials
- Non-computable Julia sets
- Computability of the Julia set. Nonrecurrent critical orbits
- Positive reducibility of the interior of filled Julia sets
- Constructing locally connected non-computable Julia sets
- Computability of Brolin-Lyubich measure
- Poly-time computability of the Feigenbaum Julia set
- On the computability of rotation sets and their entropies
- On computational complexity of Siegel Julia sets
This page was built for publication: Filled Julia sets with empty interior are computable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q941784)