5 papers · 1 filter
The tolerant learning hierarchy for c.e. sets
Vittorio Cipriani, Martin Ritter, Luca San Mauro
Learning from positive data models a scenario in which a learner receives longer and longer initial segments of an enumeration of an unknown set and repeatedly outputs a conjecture…
Isomorphism relations on classes of c.e. algebras
Meng-Che "Turbo" Ho, Martin Ritter, Luca San Mauro
We investigate the complexity of isomorphism relations for classes of finitely generated and n-generated computably enumerable (c.e.) algebras, presented via c.e. presentations --…
On the learning power of Friedman-Stanley jumps
Vittorio Cipriani, Alberto Marcone, Luca San Mauro
Recently, a surprising connection between algorithmic learning of algebraic structures and descriptive set theory has emerged. Following this line of research, we define the learni…
Classifying different criteria for learning algebraic structures
Nikolay Bazhenov, Vittorio Cipriani, Sanjay Jain +2
In the last years there has been a growing interest in the study of learning problems associated with algebraic structures. The framework we use models the scenario in which a lear…
Analogues of the countable Borel equivalence relations in the setting of computable reducibility
Uri Andrews, Luca San Mauro
Coskey, Hamkins, and Miller [CHM12] proposed two possible analogues of the class of countable Borel equivalence relations in the setting of computable reducibility of equivalence r…