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

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

Cited In (3)

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

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)