Complexity of families of learning algorithms and estimation of the nonrandomness of extraction of empirical regularities
type: Item
instance of: scholarly article
title: Complexity of families of learning algorithms and estimation of the nonrandomness of extraction of empirical regularities
zbMATH Open document ID: 1371.68231
author: V. I. Donskoy
published in: Cybernetics and Systems Analysis
publication date: 2014-10-27T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68Q30
zbMATH DE Number: 6361636
zbMATH Keywords: machine training
zbMATH Keywords: recursive functions
zbMATH Keywords: VC-dimension
zbMATH Keywords: Kolmogorov complexity
MaRDI profile type: Publication
full work available at URL: s10559-012-9402-2
OpenAlex ID: W2064143166
cites work: Q3965385
cites work: Q3924912
cites work: Q4770512
cites work: Q3783932
DOI: 10.1007/S10559-012-9402-2
description: scientific article; zbMATH DE number 6361636