Computability of Julia sets
Mark Braverman, Michael Yampolsky
Abstract
In this paper we settle most of the open questions on algorithmic computability of Julia sets. In particular, we present an algorithm for constructing quadratics whose Julia sets are uncomputable. We also show that a filled Julia set of a polynomial is always computable.
Create a lesson
Related papers
A blueprint for the formalization of norm-variation of multiple ergodic averages for commuting transformations
Floris van Doorn, Polona Durcik, Joris Roos et al.
On some aspects of discrete groups acting ergodically on the boundary
Subhadip Dey, Mikołaj Frączyk, Sebastian Hurtado
A Structural Theory of Admissible Transitions in Biological Reaction Networks
Stephan Peter, Bashar Ibrahim
Sequential and distributive dual futile cycle: Hopf bifurcation can occur under parameter-rich kinetics but cannot occur under mass action kinetics
Nicola Vassena
Rigidity on the two-torus and Sarnak's conjecture
Yinshan Chang, Jian Wang, Junchang Zhou
Linear response for random systems with a cusp
Davrbek Oltiboev, Karim Rakhimov, Marks Ruziboev