Computability of Julia sets
classification
🧮 math.DS
keywords
juliasetscomputabilityalgorithmalgorithmicalwayscomputableconstructing
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.