Recent Developments in Algorithmic Teaching

Authors: Frank J. Balbach and Thomas Zeugmann

Source: Language and Automata Theory and Applications, Third International Conference, LATA 2009, Tarragona, Spain, April 2-8, 2009, Proceedings , (Adrian Horia Dediu, Armand Mihai Ionescu, and Carlos Martín-Vide, Eds.), Lecture Notes in Computer Science 5457, pp. 1-18, Springer 2009.

Abstract. The present paper surveys recent developments in algorithmic teaching. First, the traditional teaching dimension model is recalled.

Starting from the observation that the teaching dimension model sometimes leads to counterintuitive results, recently developed approaches are presented. Here, main emphasis is put on the following aspects derived from human teaching/learning behavior: the order in which examples are presented should matter; teaching should become harder when the memory size of the learners decreases; teaching should become easier if the learners provide feedback; and it should be possible to teach infinite concepts and/or finite and infinite concept classes.

Recent developments in the algorithmic teaching achieving (some) of these aspects are presented and compared.

©Copyright 2009, Springer

Valid HTML 4.1