RUS  ENG
Full version
JOURNALS // Izvestiya Instituta Matematiki i Informatiki Udmurtskogo Gosudarstvennogo Universiteta // Archive

Izv. IMI UdGU, 2007 Issue 1(38), Pages 3–231 (Mi iimi76)

This article is cited in 2 papers

Constructivisation of the models of classification of finite objects

N. I. Kalyadin

Izhevsk State Technical University

Abstract: 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.

UDC: 519.712:510.25:510.67



© Steklov Math. Inst. of RAS, 2026