  In representation theory, the problem of classifying pairs of matrices up to
simultaneous similarity is used as a measure of complexity; classification
problems containing it are called wild problems, and the other are referred to
as tame.
