Filled Julia sets with empty interior are computable

2004/10/27 by I. Binder, Binder, I., M. Braverman +3 · 1 citation
Computer Science · Mathematics · #37F10 #Computational Complexity (cs.CC) #Dynamical Systems (math.DS) #FOS: Computer and information sciences #FOS: Mathematics #cs.CC #math.DS #msc:37F10

paper · pdf · doi:10.48550/arxiv.math/0410580

This is an expanded version, to appear in J. FoCM

arxiv created 2006/06/27 · arxiv updated 2009/12/01

Abstract

We show that if a polynomial filled Julia set has empty interior, then it is computable.

Cited by

• Computability for Axiom A Polynomial Skew Products of ℂ²

Related

• Computability of Julia sets
• Non-computable Julia sets
• On computability of Julia sets: answers to questions of Milnor and Shub
• Computability of the Julia set. Nonrecurrent critical orbits
• Almost every real quadratic polynomial has a poly-time computable Julia set