web address of the page
http://jnas.nbuv.gov.ua/article/UJRN-0000232250
Cybernetics and Systems Analysis 
А - 2019 /
Issue (2012, Т. 48, № 2)
Донской В. И.
Сложность семейств алгоритмов обучения и оценивание неслучайности извлечения эмпирических закономерностей
The paper presents a general approach to the evaluation of the complexity of classes of algorithms, the so-called pVCD-method. To develop this method, all the examined families of models of empiric generalization were limited to classes implementable on computers and wider, by examining their partly recursive presentations. Within the framework of the algorithmic approach, the concept of Kolmogorov' complexity of classes of algorithms of the recognition of properties or extraction of regularities is proposed. Based on this concept, a method is proposed to evaluate the nonrandomness of the extraction of empirical regularities.
Бібліографічний опис:
Донской В. И. Сложность семейств алгоритмов обучения и оценивание неслучайности извлечения эмпирических закономерностей. Кибернетика и системный анализ. 2012. Т. 48, № 2. С. 86-96. URL: http://jnas.nbuv.gov.ua/article/UJRN-0000232250
PDF
Transliteration