Constructivisation of the models of classification of finite objects

We consider the problems of resolvability and computability of the models of classification of finite objects. The Churchs thesis is used in our approach to the problem of classification of finite objects. The criteria of resolvability obtained determine the conditions of adequate description of finite objects as well as the effective computation of the predicates of classification.