  We prove that given a computable metric space and two computable measures,
the set of points that have high universal uniform test scores with respect to
the first measure will have a lower bound with respect to the second measure.
This result is transferred to thermodynamics, showing that algorithmic
thermodynamic entropy must oscillate in the presence of dynamics. Another
application is that outliers will become emergent in computable dynamics of
computable metric spaces.
