Algorithmic Learning Theory Book

	Program error detection/correction: Turning PAC learning into PERFECT learning	1
	Team learning as a game	2
	Inferability of recursive real-valued functions	18
	Learning of r.e. languages from good examples	32
	Identifiability of subspaces and homomorphic images of zero-reversible languages	48
	On exploiting knowledge and concept use in learning theory	62
	Partial Occam's razor and its applications	85
	Derandomized learning of Boolean functions	100
	Learning DFA from simple examples	116
	PAC learning under helpful distributions	132
	PAC learning using Nadaraya-Watson estimator based on orthonormal systems	146
	Monotone extensions of Boolean data sets	161
	Classical Brouwer-Heyting-Kolmogorov interpretation	176
	Inferring a system from examples with time passage	197
	Polynomial time inductive inference of regular term tree languages from positive data	212
	Synthesizing noise-tolerant language learners	228
	Effects of Kolmogorov complexity present in inductive inference as well	244
	Learning one-variable pattern languages very efficiently on average, in parallel, and by asking queries	260
	Oracles in [actual symbol not reproducible] are sufficient for exact learning	277
	Exact learning via teaching assistants	291
	An efficient exact learning algorithm for ordered binary decision diagrams	307
	Probability theory for the Brier game	323
	Learning and revising theories in noisy domains	339
	A note on a scale-sensitive dimension of linear bounded functionals in Banach spaces	352
	On the relevance of time in neural computation and learning	364
	A simple algorithm for predicting nearly as well as the best pruning labeled with the best prediction values of a decision tree	385
	Learning disjunctions of features	401
	Learning simple deterministic finite-memory automata	416
	Learning acyclic first-order Horn sentences from entailment	432
	On learning disjunctions of zero-one threshold functions with queries	446
	Author Index	461