COLT Proceedings 1990

Invited Lecture Inductive Inference of Minimal ProgramsTechnical Papers Identifying µ-Formula Decision Trees with Queries Learning Switch Configurations On the Computational Complexity of Approximating Distributions by Probabilistic Automata A Learning Criterion for Stochastic Rules On the Complexity of Learning Minimum Time-Bounded Turing Machines Inductive Inference from Positive Data is Powerful Inductive Indentification of Pattern Languages with Restricted Substitutions Pattern Languages Are Not Learnable On Learning Ring-Sum-Expansions Learning Functions of k Terms On the Sample Complexity of Pac-Learning Using Random and Chosen Examples Finite Learning by a "Team" Some Problems of Learning with an Oracle A Mechanical Method of Successful Scientific Inquiry Boosting a Weak Learning Algorithm by Majority On the Sample Complexity of Weak Learning Learning by Distances The Learnability of Formal Concepts Polynomial Time Algorithms for Learning Neural Nets Composite Geometric Concepts and Polynomial Predictability Learning Integer Lattices On the Number of Examples and Stages Needed for Learning Decision Trees Learning DNF Under the Uniform Distribution in Quasi-Polynomial Time Learning Via Queries with Teams and Anomalies Learning Via Queries in [+, On the Sample Complexity of Finding Good Search Strategies Inferring Graphs from Walks Aggregating StrategiesShort Abstracts Learning Conjunctions of Horn Clauses Exact Identification of Circuits Using Fixed Points of Amplification Functions Efficient Distribution-Free Learning of Probabilistic Concepts On Threshold Circuits for Parity On the Complexity of Learning from Counterexamples and Membership Queries Robust Separations in Inductive Inference Separating PAC and Mistake-Bound Learning Models Over the Boolean Domain Towards a DNA Sequencing Theory (Learning a String)Author Index