## Non-computable Julia sets

### Cached

### Download Links

- [www.ams.org]
- [arxiv.org]
- [arxiv.org]
- [www.ams.org]
- DBLP

### Other Repositories/Bibliography

Venue: | Journ. Amer. Math. Soc |

Citations: | 26 - 6 self |

### BibTeX

@ARTICLE{Braverman_non-computablejulia,

author = {M. Braverman and M. Yampolsky},

title = {Non-computable Julia sets},

journal = {Journ. Amer. Math. Soc},

year = {},

volume = {19},

pages = {2006}

}

### OpenURL

### Abstract

Polynomial Julia sets have emerged as the most studied examples of fractal sets generated by a dynamical system. Apart from the beautiful mathematics, one of the reasons for their popularity is the beauty of the computer-generated images of such sets. The algorithms used to draw these pictures vary; the most naïve work by iterating the center of a pixel to determine if it lies in the Julia set. Milnor’s distance-estimator algorithm [Mil] uses classical complex analysis to give a one-pixel estimate of the Julia set. This algorithm and its modifications work quite well for many examples, but it is well known that in some particular cases computation time will grow very rapidly with increase of the resolution. Moreover, there are examples, even in the family of quadratic polynomials, when no satisfactory pictures of the Julia set exist. In this paper we study computability properties of Julia sets of quadratic polynomials. Under the definition we use, a set is computable, if, roughly speaking, its image can be generated by a computer with an arbitrary precision. Under this notion of computability we show: Main Theorem. There exists a parameter value c ∈ C such that the Julia set of