On a subclass of tame problems
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. In this paper we study the relation between classification problems and a corresponding subclass of decision problems. We extend the tame-wild dichotomy to classification problems in small categories with the help of corresponding decision problems. We also prove a condition for a subclass of classification problems in small categories to contain tame problems only.