Computability of the Julia set. Nonrecurrent critical orbits
classification
🧮 math.DS
keywords
criticaljuliaorbitsassumingcomputabilitycomputablecontainfunction
read the original abstract
We prove that the Julia set of a rational function $f$ is computable in polynomial time, assuming that the postcritical set of $f$ does not contain any critical points or parabolic periodic orbits.
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.