everything.study
COMPSCI 2280

Computational Learning Theory

Harvard FAS

Possibilities of and limitations to performing learning by a computational process. Computationally feasible generalization and its limits. Topics include computational models of learning, polynomial time learnability, learning from examples and from queries to oracles. Applications to Boolean functions, languages and geometric functions. Darwinian evolution as learning.

Topics

Topics explicitly listed in official catalogue description

Sources