Closure operations on measures of computational complexity

In this paper, after a suitable characterization of computational complexity measures, we analyze some closure operations defined on the class of all measures with respect to a given acceptable Gödel numebering. Such a class is a distributive lattice without universal bounds. The problem of the invariance of the class of measures changing the Gödel numbering is finally considered.