20 citations · 54 across the 26 of their papers we have counts for
6 papers · 1 filter
Learning algebraic structures with the help of Borel equivalence relations
Nikolay Bazhenov, Vittorio Cipriani, Luca San Mauro
We study algorithmic learning of algebraic structures. In our framework, a learner receives larger and larger pieces of an arbitrary copy of a computable structure and, at each sta…
Punctual equivalence relations and their (punctual) complexity
Nikolay Bazhenov, Keng Meng Ng, Luca San Mauro +1
The complexity of equivalence relations has received much attention in the recent literature. The main tool for such endeavour is the following reducibility: given equivalence rela…
Approximating approximate reasoning: Fuzzy sets and the Ershov hierarchy
Nikolay Bazhenov, Manat Mustafa, Sergei Ospichev +1
Computability theorists have introduced multiple hierarchies to measure the complexity of sets of natural numbers. The Kleene Hierarchy classifies sets according to the first-order…
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…
A note on the category of equivalence relations
Valentino Delle Rose, Luca San Mauro, Andrea Sorbi
We make some beginning observations about the category of equivalence relations on the set of natural numbers, where a morphism between two equivalence relat…
On the structure of computable reducibility on equivalence relations of natural numbers
Uri Andrews, Daniel Belin, Luca San Mauro
We examine the degree structure of equivalence relations on under computable reducibility. We examine when pairs of degrees have a join. In particular, we show th…