In the first part of the talk I will give a brief overview of computability and computational complexity of Julia sets of rational functions. In the second part I will show that the Julia sets of hyperbolic maps in the exponential family are computable in polynomial time. The talk is based on a joint work with David Marti-Pete.