Calculating the mind change complexity of learning algebraic structures
From MaRDI portal
Publication:2104247
DOI10.1007/978-3-031-08740-0_1OpenAlexW4285241849MaRDI QIDQ2104247
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
Cites Work
- Unnamed Item
- On the learnability of vector spaces
- On the role of procrastination in machine learning
- Computable structures and the hyperarithmetical hierarchy
- Trees and learning
- Learning families of algebraic structures from informant
- Mind change efficient learning
- Degrees of categoricity of computable structures
- Learning algebraic structures with the help of Borel equivalence relations
- Learning Families of Closed Sets in Matroids
- Degrees of bi-embeddable categoricity
- On the Turing complexity of learning finite families of algebraic structures
- Trial and error predicates and the solution to a problem of Mostowski
- Language identification in the limit
- Learning algebraic structures from text
Related Items (2)
Learning algebraic structures with the help of Borel equivalence relations ⋮ On learning for families of algebraic structures
This page was built for publication: Calculating the mind change complexity of learning algebraic structures
