Learning and computing in the limit
Sebastiaan A. Terwijn · Cambridge University Press eBooks · 2017
Abstract. We explore two analogies between computability theory and a basic model of learning, namely Osherson and Weinsteins model theoretic learning para-digm. First, we build up the theory of model theoretic learning in a way analogous to the way computability theory is built up. We then discuss 2-denability of predicates on classes and prove a limit lemma for continuous functionals. x1. Introduction. The notion of limit computability crops up in a nat-ural way in the study of the arithmetical hierarchy and the notion of relative computability, and has been extensively studied over the last decades, see e.g. the monographs [9, 16]. The idea of learning as a limit process is also central to a large number of models of learning, in particular those