Learning and computing in the limit [chapter]

Sebastiaan A. Terwijn, Zoe Chatzidakis, Peter Koepke, Wolfram Pohlers
Logic Colloquium '02  
We explore two analogies between computability theory and a basic model of learning, namely Osherson and Weinsteins model theoretic learning paradigm. 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-definability of predicates on classes and prove a limit lemma for continuous functionals.
doi:10.1017/9781316755723.017 fatcat:a7gjfkdbdnf5dat45hnea65aji