All Title Author
Keywords Abstract

Mathematics  2006 

Computability of Julia sets

Full-Text   Cite this paper   Add to My Lib

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.

Full-Text

comments powered by Disqus