On learning for families of algebraic structures

DOI10.1134/S1995080224601334zbMATH Open1548.68101MaRDI QIDQ6634990

Nikolay Bazhenov

Publication date: 8 November 2024

Published in: Lobachevskii Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

inductive inferenceBorel equivalence relationcomputable structurealgorithmic learning theoryinfinitary formulas

Mathematics Subject Classification ID

Computational learning theory (68Q32) Computable structure theory, computable model theory (03C57)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the learnability of vector spaces
• Learning recursive functions: A survey
• Learning indexed families of recursive languages from positive data: A survey
• Computable structures and the hyperarithmetical hierarchy
• Trees and learning
• Calculating the mind change complexity of learning algebraic structures
• Learning families of algebraic structures from informant
• Learning algebraic structures with the help of Borel equivalence relations
• Learning Families of Closed Sets in Matroids
• A Glimm-Effros Dichotomy for Borel Equivalence Relations
• The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility
• On the Turing complexity of learning finite families of algebraic structures
• Turing computable embeddings
• Comparing Classes of Finite Structures
• Trial and error predicates and the solution to a problem of Mostowski
• Language identification in the limit
• Learning algebraic structures from text

This page was built for publication: On learning for families of algebraic structures

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