MSC (2000) 68Q30, 68Q15, 03D15, 28A78Classical fractal dimensions (Hausdorff dimension and packing dimension) have recently been effectivized by (i) characterizing them in terms of real-valued functions called gales, and (ii) imposing computability and complexity constraints on these gales. This paper surveys these developments and their applications in algorithmic information theory and computational complexity theory.