Computability of the Julia set. Nonrecurrent critical orbits
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.