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

DOI10.1007/S10559-012-9402-2MaRDI QIDQ466362zbMATH OpenOpenAlexFDO

Authors 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

Kolmogorov complexitymachine trainingrecursive functionsVC-dimension

Mathematics Subject Classification ID

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

Recommendations

• TheKolmogorov Legacy in Physics
• Methods and applications of algorithmic complexity. Beyond statistical lossless compression
• scientific article; zbMATH DE number 3951668
• Algorithmic Complexity and Stochastic Properties of Finite Binary Sequences
• scientific article; zbMATH DE number 2206866

Cited in

(2)

• A Synthesis of Pseudo-Boolean Empirical Models by Precedential Information
• TheKolmogorov Legacy in Physics

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q466362)