Calculating the mind change complexity of learning algebraic structures

DOI10.1007/978-3-031-08740-0_1OpenAlexW4285241849MaRDI QIDQ2104247FDOQ2104247

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

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

zbMATH Keywords

inductive inferencealgorithmic learning theorycomputable structuresmind change complexity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

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

Cited In (4)

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

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)