Classifying the Arithmetical Complexity of Teaching Models
From MaRDI portal
Publication:2830273
DOI10.1007/978-3-319-46379-7_10zbMath1478.68109arXiv1610.08590OpenAlexW2523055160MaRDI QIDQ2830273
Sandra Zilles, Achilles A. Beros, Ziyuan Gao
Publication date: 9 November 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.08590
Computational learning theory (68Q32) Complexity of computation (including implicit computational complexity) (03D15)
Related Items
Cites Work
- Unnamed Item
- Teachability in computational learning
- The synthesis of language learners.
- On the complexity of teaching
- LEARNING THEORY IN THE ARITHMETIC HIERARCHY
- The position of index sets of identifiable sets in the arithmetical hierarchy
- Inductive inference of formal languages from positive data
- Indexmengen und Erkennung Rekursiver Funktionen
- Distinguishing Pattern Languages with Membership Examples
- Language identification in the limit