Class  Date  Content  Homework 
1  Tuesday, Feb 5^{th}  Content: General Introduction to Formal Learning Theory, The Overview of Paradigms, Philosophical Significance, Language Learning: Basic Notions and Definitions Downloads: An Inductive Inference Game; Slides 
– 
2  Friday, Feb 8^{th}  Content: Gold Theorems, Locking Sequence Theorem, Telltale Subsets, Angluin’s Theorem Downloads: Handout 
Homework1 
3  Tuesday, Feb 12^{th}  Content: General Introduction to Recursion Theory for Formal Learning Theory Downloads: Handout, 1st Chapter of Rogers’ “Theory of Recursive Functions and Effective Computability” 
– 
4  Friday, Feb 15^{th}  Content: Restrictions on Learners; Consistent, Conservative, and Incremental Learners Downloads: Handout 
Homework2 
5  Tuesday, Feb 19^{th}  Content: Restrictions on Learners; Consistent, Conservative, and Incremental Learners (Continuation), The Restrictiveness of Effectivity  
6  Friday, Feb 22^{nd}  Content: Uniformly Recursive Families of Languages; Uniformly Recursively Enumerable Families of Languages; Angluin’s Characterization Theorem for Effective Identifiability; Finite Thickness; An Example: Identifiability of Restricted Regular Languages Downloads: Uniformity and Angluin’s Theorem (Handout); Finite Thickness and Identifiability of Restricted Regular Languages (Handout) 
Homework3 
7  Tuesday, Feb 26^{th}  Content: Sufficient Conditions for Identification: Finite Thickness Downloads: Handout 

8  Friday, Mar 1^{st}  Content: Sufficient Conditions for Identification: Finite Elasticity, Characteristic Sets Downloads: see previous lecture. 
Homework4 
9  Tuesday, Mar 5^{th}  Content: Restrictiveness of Conservativity, Characterization of Conservative Identifiability Downloads: Handout 

10  Friday, Mar 8^{th}  Content: Behaviorally Correct Learning Downloads: Handout 
Homework5 
11  Tuesday, Mar 12^{th}  Content: Finite Identifiability: Characterization and Complexity Downloads: Paper, Handout; “Characterization of Finite Identification” by Y. Mukouchi 

12  Friday, Mar 15^{th}  Content: Finite Identifiability: Complexity; Fastest Finite Identification (Continuation) Downloads: see previous lecture 
Homework6 
13  Tuesday, Mar 19^{th}  Content: Modeltheoretic Learning, FirstOrder Framework of Inquiry Downloads: Slides 

14  Friday, Mar 22^{nd}  Content: Modeltheoretic Learning, FirstOrder Framework of Inquiry (Continuation) Downloads: see previous lecture 

– 