Proceedings of the Third Annual Workshop on Computational Learning Theory : University of Rochester, Rochester, New York, August 6-8, 1990 / sponsored by the ACM SIGACT/SIGART ; [edited by] Mark Fulk, John Case
2 Stochastic Rules and Their Hierarchical Parameter Structures3 A Learning Criterion for Stochastic Rules -- A Stochastic PAC Model; 4 Hierarchical Learning Based on the MDL Principle; 5 The Optimality of MDL Rules and Their Convergence Rates; 6 Sample Complexity and Learnability of Stochastic Decision List Classes; 7 Concluding Remarks; References; Chapter 6. ON THE COMPLEXITY OF LEARNING MINIMUM TIME-BOUNDED TURING MACHINES; Abstract; 1. INTRODUCTION; 2. DEFINITIONS; 3. MAIN RESULTS; 4. PROOFS; 5. OPEN QUESTIONS; References; Chapter 7. INDUCTIVE INFERENCE FROM POSITIVE DATA IS POWERFUL
ABSTRACTINTRODUCTION; PRELIMINARIES; ELEMENTARY FORMAL SYSTEMS; INDUCTIVE INFERENCE FROM POSITIVE DATA; INDUCTIVE INFERENCE OF EFS MODELS FROM POSITIVE DATA; INDUCTIVE INFERENCE OF EFS LANGUAGES FROM POSITIVE DATA; DISCUSSION; Acknowledgments; References; Chapter 8. INDUCTIVE IDENTIFICATION OF PATTERN LANGUAGES WITH RESTRICTED SUBSTITUTIONS; ABSTRACT; PATTERN LANGUAGES OVER AN ARBITRARY BASE; PUMPING LEMMA; APPLICATION TO INDUCTIVE INFERENCE; References; Chapter 9. Pattern Languages Are Not Learnable; 1 Introduction; 2 PRELIMINAR IES; 3 The Main Result; Acknowledgments; References
Bibliography
Includes bibliographical references and index
Notes
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. http://purl.oclc.org/DLF/benchrepro0212 MiAaHDL
English
digitized 2010 HathiTrust Digital Library committed to preserve pda MiAaHDL