Complexity of families of learning algorithms and estimation of the nonrandomness of extraction of empirical regularities

DOI10.1007/S10559-012-9402-2zbMath1371.68231OpenAlexW2064143166MaRDI QIDQ466362

V. I. Donskoy

Publication date: 27 October 2014

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-012-9402-2

zbMATH Keywords

VC-dimensionKolmogorov complexityrecursive functionsmachine training

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Related Items (1)

A Synthesis of Pseudo-Boolean Empirical Models by Precedential Information

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Complexity of families of learning algorithms and estimation of the nonrandomness of extraction of empirical regularities