Computability in Europe 2008
Logic and Theory of Algorithms
|Author(s):||Sanjay Jain, Frank Stephan and Nan Ye|
|Slot:||Mon, 11:20-11:40, Senate (col. 3)|
This work extends studies of Angluin, Lange and Zeugmann on how learnability of a language class depends on the hypothesis space used by the learner. While previous studies mainly focused on the case where the learner chooses a particular hypothesis space, the goal of this work is to investigate the case where the learner has to cope with all possible hypothesis spaces. In that sense, the present work combines the approach of Angluin, Lange and Zeugmann with the question of how a learner can be synthesized. The investigation for the case of uniformly r.e. classes has been done by Jain, Stephan and Ye. This paper investigates the case for indexed families and gives a special attention to the notions of conservative and non U-shaped learning.
|websites: Arnold Beckmann||2008-05-18|