| **A Tale of Two Classifier Systems** - *George G. Robertson and Rick L. Riolo* - 1988 |

| **Task decomposition through competition in a modular connectionist architecture: The what and where vision tasks** - *R. A. Jacobs, M. A. Jordan and A. G. Barto* - March 1990 |

| **Task-Structures, Knowledge Acquisition and Learning** - *B. Chandrasekaran* - 1989 |

| **TD converges with probability 1** - *Peter Dayan and Terrence J. Sejnowski* - 1994 |

| **TD models: modeling the world at a mixture of time scales** - *Richard S. Sutton* - 1995 |

| **Teachability in computational learning** - *A. Shinohara and S. Miyano* - 1991 |

| **Teachability in Computational Learning** - *T. Shinohara* - 1991 |

| **Teachers, Learners and Black Boxes** - *Dana Angluin and Mārtiņš Krikis* - 1997 |

| **Teaching a smarter learner** - *Sally A. Goldman and H. David Mathias* - 1996 |

| **Technical and scientific issues of KDD** - *Yves Kodratoff* - 1995 |

| **Technical note: an upper bound on the loss from approximate optimal-value functions** - *Satinder P. Singh and Richard C. Yee* - 1994 |

| **Technical Note: Bias and the Quantification of Stability** - *Peter Turney* - 1995 |

| **Technical note: incremental multi-step Q-learning** - *Jing Peng and Ronald J. Williams* - 1996 |

| **Technical Note Q-Learning** - *Christopher J. C. H. Watkins and Peter Dayan* - 1992 |

| **Technical Note: Some Properties of Splitting Criteria** - *Leo Breiman* - 1996 |

| **Technical note: statistical methods for analyzing speedup learning experiments** - *Oren Etzioni and Ruth Etzioni* - 1994 |

| **A technique for upper bounding the spectral norm with applications to learning** - *M. Bellare* - 1992 |

| **Techniques using LISP for automatically discovering interesting relations in data** - *E. Fredkin* - 1964 |

| **Tensor Manipulation Networks: Connectionist and Symbolic Approaches to Comprehension, Learning, and Planning** - *C. P. Dolan* - June 1989 |

| **Testing and inductive inference: abstract approaches** - *J. Cherniavsky and R. Statman* - 1987 |

| **Testing As A Dual To Learning** - *K. Romanik* - June 1991 |

| **Testing finite state machines** - *M. Yannakakis and D. Lee* - 1991 |

| **Text categorization and relational learning** - *William W. Cohen* - 1995 |

| **Theoretical analysis of the nearest neighbor classifier in noisy domains** - *Seishi Okamoto and Nobuhiro Yugami* - 1996 |

| **A theoretical and empirical study of a noise-tolerant algorithm to learn geometric patterns** - *Sally A. Goldman and Stephen D. Scott* - 1996 |

| **Theorie der Zeichenerkennung** - *V. N. Vapnik* - 1979 |

| **Theory and applications of agnostic PAC-learning with small decision trees** - *Peter Auer, Robert C. Holte and Wolfgang Maass* - 1995 |

| **A Theory and Methodology of Inductive Inference** - *R. S. Michalski* - 1986 |

| **Theory Change via View Application in Instructionless Learning** - *Jeff Shrager* - 1987 |

| **A Theory for Memory-Based Learning** - *Jyh-Han Lin and Jeffrey Scott Vitter* - 1994 |

| **A Theory of Historical Discovery: The Construction of Componential Models** - *Jan M. Zytkow and Herbert A. Simon* - 1986 |

| **The theory of inductive inference** - *J. M. Barzdin and K. M. Podnieks* - 1973 |

| **A Theory of Learning Classification Rules** - *W. L. Buntine* - 1990 |

| **A theory of learning simple concepts under simple distributions and average case complexity for the universal distribution** - *M. Li and P. M. B. Vitanyi* - 1989 |

| **Theory of Learning: What’s Hard and What’s Easy to Learn** - *R. L. Rivest* - 1991 |

| **A Theory of Networks for Approximation and Learning** - *T. Poggio and F. Girosi* - September 1990 |

| **A Theory of the Learnable** - *L. G. Valiant* - November 1984 |

| **Theory-guided empirical speedup learning of goal decomposition rules** - *Chandra Reddy, Prasad Tadepalli and Silvana Roncagliolo* - 1996 |

| **Theory-guided induction of logic programs by inference of regular languages** - *Henrik Boström* - 1996 |

| **Therapy plan generation as program synthesis** - *O. Arnold and K. P. Jantke* - 1994 |

| **A Thesis in Inductive Inference** - *R. Wiehagen* - 1990 |

| **Thoughts on Hypothesis Boosting** - *M. Kearns* - December 1988 |

| **Three decades of team learning** - *C. H. Smith* - 1994 |

| **Thue systems and DNA - a learning algorithm for a subclass** - *R. Siromoney, D. G. Thomas, K. G. Subramanian and V. R. Dare* - 1993 |

| **Tight worst-case loss bounds for predicting with expert advice** - *David Haussler, Jyrki Kivinen and Manfred K. Warmuth* - 1995 |

| **To discount or not to discount in reinforcement learning: a case study comparing R learning and Q learning** - *Sridhar Mahadevan* - 1994 |

| **Too Much Information Can be too Much for Efficient Learning** - *R. Wiehagen and T. Zeugmann* - 1992 |

| **Topics in Learning Theory** - *M. Kearns and U. Vazirani* - 1992 |

| **Topics in Statistical Pattern Recognition** - *T. M. Cover and T. J. Wagner* - 1976 |

| **Total complexity and the inference of best programs** - *J. A. Feldman and P. Shields* - 1977 |

| **Toward a Mathematical Theory of Inductive Inference** - *L. Blum and M. Blum* - June 1975 |

| **Toward a model of mind as a laissez-faire economy of idiots** - *Eric B. Baum* - 1996 |

| **Toward a Modern Theory of Adaptive Networks: Expectation and Prediction** - *R. S. Sutton and A. G. Barto* - 1981 |

| **Toward a Unified Science of Machine Learning** - *P. Langley* - 1989 |

| **Toward an ideal trainer** - *Susan L. Epstein* - 1994 |

| **Toward efficient agnostic learning** - *Michael J. Kearns, Robert E. Schapire and Linda M. Sellie* - 1994 |

| **Toward optimal feature selection** - *Daphne Koller and Mehran Sahami* - 1996 |

| **Towards a better understanding of memory-based reasoning systems** - *John Rachlin, Simon Kasif, Steven Salzberg and David W. Aha* - 1994 |

| **Towards a DNA sequencing theory learning a string** - *M. Li* - 1990 |

| **Towards a more comprehensive theory of learning in computers** - *P. M. Long* - 1992 |

| **Towards Chunking as a General Learning Mechanism** - *J. Laird, P. Rosenbloom and A. Newell* - August 1984 |

| **Towards efficient inductive synthesis from input/output examples** - *J. Barzdinš* - 1994 |

| **Towards efficient inductive synthesis of expressions from input/output examples** - *J. Barzdins, G. Barzdins, K. Apsitis and U. Sarkans* - 1993 |

| **Towards learning by abstraction** - *S. Sakurai and M. Haraguchi* - 1992 |

| **Towards realistic theories of learning** - *N. Abe* - 1994 |

| **Towards representation independence in PAC learning** - *M. Warmuth* - 1989 |

| **Towards Representation Independence in PAC-learning** - *M. K. Warmuth* - October 1989 |

| **Towards robust model selection using estimation and approximation error bounds** - *Joel Ratsaby, Ronny Meir and Vitaly Maiorov* - 1996 |

| **Towards the Development of an Analysis of Learning Algorithms** - *R. Daley* - 1986 |

| **Tracking drifting concepts by minimizing disagreements** - *David P. Helmbold and Philip M. Long* - 1994 |

| **Tracking drifting concepts using random examples** - *D. P. Helmbold and P. M. Long* - 1991 |

| **Tracking the best disjunction** - *Peter Auer and Manfred Warmuth* - 1995 |

| **Tracking the best expert** - *Mark Herbster and Manfred Warmuth* - 1995 |

| **Trade-Off Among Parameters Affecting Inductive Inference** - *R. Freivalds, C. H. Smith and M. Velauthapillai* - 1989 |

| **Tradeoffs in Machine Inductive Inference** - *K. Chen* - 1981 |

| **Tradeoffs in the inductive inference of nearly minimal size programs** - *K. J. Chen* - 1982 |

| **Trading accuracy for simplicity in decision trees** - *Marko Bohanec and Ivan Bratko* - 1994 |

| **Trading monotonicity demands versus efficiency** - *S. Lange and T. Zeugmann* - 1995 |

| **Trading Monotonicity Demands versus Mind Changes** - *S. Lange and T. Zeugmann* - 1995 |

| **Training a 3-node neural net is NP-Complete** - *A. Blum and R. L. Rivest* - 1989 |

| **A training algorithm for optimal margin classifiers** - *B. E. Boser, I. M. Guyon and V. N. Vapnik* - 1992 |

| **Training digraphs** - *H.-C. Tu and C. H. Smith* - 1994 |

| **Training sequences** - *D. Angluin, W. Gasarch and C. Smith* - 1989 |

| **Transfer of Learning by Composing Solutions of Elemental Sequential Tasks** - *Satinder Pal Singh* - 1992 |

| **Transformation of probabilistic learning strategies into deterministic learning strategies** - *R. Daley* - 1988 |

| **Trees and learning** - *Wolfgang Merkle and Frank Stephan* - 1996 |

| **Trial and Error: a New Approach to Space-bounded Learning** - *F. Ameur, P. Fischer, K. U. Höffgen and F. Meyer auf der Heide* - 1994 |

| **Two New Frameworks for Learning** - *B. K. Natarajan and P. Tadepalli* - June 1988 |

| **Two Theorems on the Limiting Synthesis of Functions** - *J. M. Barzdin* - 1974 |

| **Two Variations of Inductive Inference of Languages from Positive Data** - *T. Tabe and T. Zeugmann* - 1995 |

| **A typed -calculus for proving-by-example and bottom-up generalization procedure** - *M. Hagiya* - 1993 |

| **Typed pattern languages and their learnability** - *Takeshi Koshiba* - 1995 |

| **Types of monotonic language learning and their characterization** - *S. Lange and T. Zeugmann* - 1992 |

| **Types of noise in data for concept learning** - *R. Sloan* - 1988 |

| **Types of queries for concept learning** - *D. Angluin* - June 1986 |