Recent Developments in Algorithmic Teaching
From MaRDI portal
Publication:3618563
DOI10.1007/978-3-642-00982-2_1zbMath1234.68165MaRDI QIDQ3618563
Thomas Zeugmann, Frank J. Balbach
Publication date: 2 April 2009
Published in: Language and Automata Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-00982-2_1
68Q32: Computational learning theory
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Teachability in computational learning
- Measuring teachability using variants of the teaching dimension
- Teaching a smarter learner.
- On the power of inductive inference from good examples
- Self-directed learning and its relation to the VC-dimension and to teacher-directed learning
- A model of interactive teaching
- Learning from different teachers
- Queries revisited.
- On the complexity of teaching
- On specifying Boolean functions by labelled examples
- Witness sets for families of binary vectors
- Learning Binary Relations and Total Orders
- A threshold of ln n for approximating set cover
- Teaching Memoryless Randomized Learners Without Feedback
- DNF Are Teachable in the Average Case
- Teaching Randomized Learners
- Algorithmic Learning Theory
- Learning Theory
- On the learnability of recursively enumerable languages from good examples