Learning families of algebraic structures from text

DOI10.1007/978-3-031-64309-5_14MaRDI QIDQ7030907zbMATH OpenFDO

Authors Nikolay Bazhenov, E. B. Fokina, Dino Rossegger, Alexandra Soskova, S. Vatev

Publication date 7 February 2025

Full work available at URL https://doi.org/10.1007/978-3-031-64309-5_14

zbMATH Keywords

algorithmic learninginfinitary logicScott topology

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Other infinitary logic (03C75) Computational learning theory (68Q32)

Cites work

• Comparing Classes of Finite Structures
• Computable embeddings for pairs of linear orders
• Computable structures and the hyperarithmetical hierarchy
• Enumeration reducibility and partial degrees
• scientific article; zbMATH DE number 4160710 (Why is no real title available?)
• scientific article; zbMATH DE number 2237373 (Why is no real title available?)
• 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
• Limit learning equivalence structures
• On the learnability of vector spaces
• On the Turing complexity of learning finite families of algebraic structures
• 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
• Turing computable embeddings

Cited in

(3)

• Syntactic characterization of learnability of structures with mind changes
• On learning existentially definable subsets in a computable structure
• Classifying different criteria for learning algebraic structures

This page was built for publication: Learning families of algebraic structures from text

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