On the Concept of Compositional Complexity

DOI10.1007/978-3-319-99492-5_5MaRDI QIDQ6104514zbMATH OpenOpenAlexFDO

Authors L. I. Rozonoèr

Publication date 28 June 2023

Published in Braverman Readings in Machine Learning. Key Ideas from Inception to Current State (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-99492-5_5

Mathematics Subject Classification ID

History of computer science (68-03) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Measures of complexity in the theory of machine learning
• Compactness Hypothesis, Potential Functions, and Rectifying Linear Space in Machine Learning
• Complexity of functions: Some questions, conjectures, and results
• On algorithm complexity
• scientific article; zbMATH DE number 194333

Cited in

(2)

• Complexity of terms, composition, and hypersubstitution
• Compactness Hypothesis, Potential Functions, and Rectifying Linear Space in Machine Learning

This page was built for publication: On the Concept of Compositional Complexity

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