We design an algorithm for computing the generalized (algebraic circuits with root extraction) {\em additive complexity} of any rational function. It is the first computability result of this sort on the additive complexity of algebraic circuits (cf. [SW 80]).