Computability of the Julia set. Nonrecurrent critical orbits

preprint2011arXivOpen access

Abstract

We prove that the Julia set of a rational function ff is computable in polynomial time, assuming that the postcritical set of ff does not contain any critical points or parabolic periodic orbits.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.