Calculating the mind change complexity of learning algebraic structures

DOI10.1007/978-3-031-08740-0_1MaRDI QIDQ2104247zbMATH OpenOpenAlexFDO

Authors Vittorio Cipriani, Luca San Mauro, Nikolay Bazhenov

Publication date 7 December 2022

Full work available at URL https://doi.org/10.1007/978-3-031-08740-0_1

zbMATH Keywords

inductive inferencealgorithmic learning theorycomputable structuresmind change complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• On learning for families of algebraic structures
• On the Turing complexity of learning finite families of algebraic structures
• Learning families of algebraic structures from informant
• Learning algebraic structures from text
• scientific article; zbMATH DE number 1301799

Cites work

• scientific article; zbMATH DE number 722611 (Why is no real title available?)
• Computable structures and the hyperarithmetical hierarchy
• Degrees of bi-embeddable categoricity
• Degrees of categoricity of computable structures
• Language identification in the limit
• Learning algebraic structures from text
• Learning algebraic structures with the help of Borel equivalence relations
• Learning families of algebraic structures from informant
• Learning families of closed sets in matroids
• Mind change efficient learning
• On the Turing complexity of learning finite families of algebraic structures
• On the learnability of vector spaces
• On the role of procrastination in machine learning
• Trees and learning
• Trial and error predicates and the solution to a problem of Mostowski

Cited in

(4)

• An algebra of human concept learning
• Learning algebraic structures with the help of Borel equivalence relations
• Mind change complexity of learning logic programs
• On learning for families of algebraic structures

This page was built for publication: Calculating the mind change complexity of learning algebraic structures

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