Abstract
The Hausdorff dimension D0 of a strange attractor is argued to be the fixed point of a recursive relation, defined in terms of a suitable average of the smallest distances δi between points on the attractor. A fast numerical algorithm is developed to compute D0. The spread λ in the convergence rates towards zero of the distances δi (uniformity factor) as well as the stability of the fixed point are discussed in terms of the entropy of the δi distribution.