Learning families of algebraic structures from informant

DOI10.1016/J.IC.2020.104590zbMath1496.68162arXiv1905.01601OpenAlexW2943260620MaRDI QIDQ2216113

Luca San Mauro, Ekaterina B. Fokina, Nikolay Bazhenov

Publication date: 15 December 2020

Published in: Information and Computation (Search for Journal in Brave)

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

zbMATH Keywords

linear ordersinfinitary logicinductive inferencecomputable structuresalgorithmic learningTuring-computable embeddings

Mathematics Subject Classification ID

Computational learning theory (68Q32) Computable structure theory, computable model theory (03C57)

Related Items (5)

Learning algebraic structures with the help of Borel equivalence relations ⋮ Learnability and positive equivalence relations ⋮ Computable embeddings for pairs of linear orders ⋮ Calculating the mind change complexity of learning algebraic structures ⋮ A note on computable embeddings for ordinals and their reverses

Cites Work

• Unnamed Item
• Unnamed Item
• Hypothesis spaces for learning
• Comparison of identification criteria for machine inductive inference
• On the learnability of vector spaces
• Learning recursive functions: A survey
• Learning indexed families of recursive languages from positive data: A survey
• Algorithmic complexity of algebraic systems
• Computable structures and the hyperarithmetical hierarchy
• Trees and learning
• Turing Computability
• Counting the back-and-forth types
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Toward a mathematical theory of inductive inference
• Computable Structure Theory
• Turing computable embeddings
• Comparing Classes of Finite Structures
• Language identification in the limit
• Learning algebraic structures from text

This page was built for publication: Learning families of algebraic structures from informant