Kolmogorov complexity of classes of general recursive functions with bounded dimension

MaRDI QIDQ3440964zbMATH OpenFDO

Authors V. I. Donskoy

Publication date 29 May 2007

zbMATH Keywords

Kolmogorov complexityrecursive functionVapnik-Chervonenkis dimension

Mathematics Subject Classification ID

Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30)

Recommendations

• Complexity of computing Vapnik-Chervonenkis dimension and some generalized dimensions
• On the Vapnik-Chervonenkis dimension of computer programs which use transcendental elementary operations
• scientific article; zbMATH DE number 5158952
• Density and dimension
• On the Kolmogorov complexity of functions of finite smoothness

Cited in

(2)

• HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT
• RECURSIVE BAIRE CLASSIFICATION AND SPEEDABLE FUNCTIONS

This page was built for publication: Kolmogorov complexity of classes of general recursive functions with bounded dimension

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