Classifying different criteria for learning algebraic structures
From MaRDI portal
Cites work
- A Glimm-Effros Dichotomy for Borel Equivalence Relations
- Calculating the mind change complexity of learning algebraic structures
- Comparison of identification criteria for machine inductive inference
- Computable Structure Theory
- Computable structures and the hyperarithmetical hierarchy
- scientific article; zbMATH DE number 1670875 (Why is no real title available?)
- Inductive inference of formal languages from positive data
- Invariant descriptive set theory
- 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 algebraic structures from text
- Learning families of closed sets in matroids
- Learning indexed families of recursive languages from positive data: A survey
- Learning recursive functions: A survey
- Learning strategies
- Limit learning equivalence structures
- On learning for families of algebraic structures
- On the learnability of vector spaces
- On the Turing complexity of learning finite families of algebraic structures
- Syntactic characterization of learnability of structures with mind changes
- Trees and learning
- Trial and error predicates and the solution to a problem of Mostowski
This page was built for publication: Classifying different criteria for learning algebraic structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6912198)