Library Hours
Monday to Friday: 9 a.m. to 9 p.m.
Saturday: 9 a.m. to 5 p.m.
Sunday: 1 p.m. to 9 p.m.
Naper Blvd. 1 p.m. to 5 p.m.
     
Limit search to available items
Results Page:  Previous Next
Conference Workshop on Computational Learning Theory (3rd : 1990 : Rochester, N.Y.)

Title 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. [O'Reilly electronic resource]

Imprint San Mateo, Calif. : Morgan Kaufmann Publishers, ©1990.
QR Code
Description 1 online resource : illustrations
Bibliography Includes bibliographical references and index.
System Details 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
Processing Action digitized 2010 HathiTrust Digital Library committed to preserve pda MiAaHDL
Contents 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
Access Use copy Restrictions unspecified. star MiAaHDL
Reproduction Electronic reproduction. [Place of publication not identified] : HathiTrust Digital Library, 2010. MiAaHDL
Language English.
Subject Computational learning theory -- Congresses.
Théorie de l'apprentissage informatique -- Congrès.
Computational learning theory
Apprentissage automatique -- Congrès.
Genre Congress
proceedings (reports)
Conference papers and proceedings
Conference papers and proceedings.
Actes de congrès.
Added Author Fulk, Mark A.
Case, John, 1942-
ACM Special Interest Group for Automata and Computability Theory.
SIGART.
Added Title Colt '90.
Computational learning theory.
Other Form: Print version: Workshop on Computational Learning Theory (3rd : 1990 : Rochester, N.Y.). Proceedings of the Third Annual Workshop on Computational Learning Theory. San Mateo, Calif. : Morgan Kaufmann Publishers, ©1990 9781558601468 (DLC) 90041088 (OCoLC)21972833
ISBN 9780323137706 (electronic bk.)
0323137709 (electronic bk.)
1299196551
9781299196551
Patron reviews: add a review
Click for more information
EBOOK
No one has rated this material

You can...
Also...
- Find similar reads
- Add a review
- Sign-up for Newsletter
- Suggest a purchase
- Can't find what you want?
More Information