3 papers
math.LO2021
On the Turing complexity of learning finite families of algebraic structures
Nikolay Bazhenov, Luca San Mauro
In previous work, we have combined computable structure theory and algorithmic learning theory to study which families of algebraic structures are learnable in the limit (up to iso…
math.LO2020
Comparing the isomorphism types of equivalence structures and preorders
Nikolay Bazhenov, Luca San Mauro
A general theme of computable structure theory is to investigate when structures have copies of a given complexity . We discuss such problem for the case of equivalence structur…
math.LO2019
Learning families of algebraic structures from informant
Nikolay Bazhenov, Ekaterina Fokina, Luca San Mauro
We combine computable structure theory and algorithmic learning theory to study learning of families of algebraic structures. Our main result is a model-theoretic characterization…