On the Turing complexity of learning finite families of algebraic structures

DOI10.1093/LOGCOM/EXAB044OpenAlexW3185673578MaRDI QIDQ5163997

Luca San Mauro, Nikolay Bazhenov

Publication date: 9 November 2021

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.14515

zbMATH Keywords

infinitary logicinductive inferencecomputable structuresalgorithmic learning theoryTuring degrees

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Related Items (2)

Learning algebraic structures with the help of Borel equivalence relations ⋮ Calculating the mind change complexity of learning algebraic structures

This page was built for publication: On the Turing complexity of learning finite families of algebraic structures