Learning algebraic structures with the help of Borel equivalence relations

DOI10.1016/j.tcs.2023.113762OpenAlexW3210270138MaRDI QIDQ2689445

Luca San Mauro, Vittorio Cipriani, 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

Borel equivalence relationsinductive inferencecomputable structuresalgorithmic learning theorycontinuous reducibility

Mathematics Subject Classification ID

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

Related Items (1)

Calculating the mind change complexity of learning algebraic structures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unifying logic, topology and learning in parametric logic
• On the learnability of vector spaces
• Learning recursive functions: A survey
• Learning indexed families of recursive languages from positive data: A survey
• Topological properties of concept spaces (full version)
• Belief revision in the service of scientific discovery
• 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
• Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
• Turing Computability
• Learning Families of Closed Sets in Matroids
• A Borel reductibility theory for classes of countable structures
• Borel Equivalence Relations
• Lectures on Infinitary Model Theory
• Stability of nilpotent groups of class 2 and prime exponent
• A Glimm-Effros Dichotomy for Borel Equivalence Relations
• The completeness of the isomorphism relation for countable Boolean algebras
• The Hierarchy of Equivalence Relations on the Natural Numbers Under Computable Reducibility
• Computable Reducibility for Cantor Space
• 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: Learning algebraic structures with the help of Borel equivalence relations