Measuring teachability using variants of the teaching dimension
Theoretical Computer Science
Recent Developments in Algorithmic Teaching
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
A Dialectic Approach to Problem-Solving
DS '09 Proceedings of the 12th International Conference on Discovery Science
Teaching randomized learners with feedback
Information and Computation
Models of Cooperative Teaching and Learning
The Journal of Machine Learning Research
Teaching memoryless randomized learners without feedback
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
A pragmatic logic of scientific discovery
DS'06 Proceedings of the 9th international conference on Discovery Science
Teaching learners with restricted mind changes
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
COLT'06 Proceedings of the 19th annual conference on Learning Theory
Teaching classes with high teaching dimension using few examples
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Assisting scientific discovery with an adaptive problem solver
DS'05 Proceedings of the 8th international conference on Discovery Science
Massive online teaching to bounded learners
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Hi-index | 0.00 |
We introduce a new model of a learner learning an unknown concept from examples with a teacher's help. In such models, “outright coding” refers to a situation in which the teacher sends the learner a representation of the concept, either directly or encoded via the examples. Previous models have used adversarial learners or adversarial teachers to try to prevent outright coding. Our model is an attempt to reflect more directly some of the reasons that outright coding is not a common mode of human learning.We model the learner as a Turing machine with oracle access to another programming system, called its “function box.” The programming system in its function box is initially unknown to the learner. The target concept is a partial recursive function and the goal of the learner is to find in its function box a function that is equal to or extends the target concept. We exhibit a class of learner/teacher pairs in which the learner can learn any partial recursive function, provided that the learner's function box is “not too much slower” than the teacher's. This result is shown not to hold if the learner's function box can contain an arbitrary acceptable programming system.