Learning algebraic structures with the help of Borel equivalence relations

DOI10.1016/J.TCS.2023.113762OpenAlexW3210270138MaRDI QIDQ2689445FDOQ2689445

Authors Vittorio Cipriani, Luca San Mauro, Nikolay Bazhenov 

Publication date 10 March 2023

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2110.14512

zbMATH Keywords

inductive inferencealgorithmic learning theorycomputable structuresBorel equivalence relationscontinuous reducibility

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 1450824 (Why is no real title available?)
• A Borel reductibility theory for classes of countable structures
• A Glimm-Effros Dichotomy for Borel Equivalence Relations
• Belief revision in the service of scientific discovery
• Borel equivalence relations
• Borel equivalence relations. Structure and classification
• Calculating the mind change complexity of learning algebraic structures
• Comparing Classes of Finite Structures
• Computable Reducibility for Cantor Space
• Computable structures and the hyperarithmetical hierarchy
• Invariant descriptive set theory
• Language identification in the limit
• Learning algebraic structures from text
• Learning families of algebraic structures from informant
• Learning families of closed sets in matroids
• Learning indexed families of recursive languages from positive data: A survey
• Learning recursive functions: A survey
• Lectures on Infinitary Model Theory
• Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
• On the Turing complexity of learning finite families of algebraic structures
• On the learnability of vector spaces
• Stability of nilpotent groups of class 2 and prime exponent
• The completeness of the isomorphism relation for countable Boolean algebras
• The hierarchy of equivalence relations on the natural numbers under computable reducibility
• Topological properties of concept spaces (full version)
• Trees and learning
• Trial and error predicates and the solution to a problem of Mostowski
• Turing computability. Theory and applications
• Turing computable embeddings
• Unifying logic, topology and learning in parametric logic

Cited in

(3)

• Calculating the mind change complexity of learning algebraic structures
• Learning algebraic structures with the help of Borel equivalence relations
• On learning for families of algebraic structures

This page was built for publication: Learning algebraic structures with the help of Borel equivalence relations

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