Syntactic characterization of learnability of structures with mind changes
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3732038 (Why is no real title available?)
- Calculating the mind change complexity of learning algebraic structures
- Classifying different criteria for learning algebraic structures
- Computable structures and the hyperarithmetical hierarchy
- Effective model theory vs. recursive model theory
- Generic copies of countable structures
- Inductive inference of formal languages from positive data
- Language identification in the limit
- Learning Theory
- 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 languages from positive data and negative counterexamples
- Limit learning equivalence structures
- 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
- Scientific discovery on positive data via belief revision
- Systems that learn. An introduction to learning theory for cognitive and computer scientists
- Trial and error predicates and the solution to a problem of Mostowski
This page was built for publication: Syntactic characterization of learnability of structures with mind changes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6884281)
