Birds can fly…

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Birds can fly…

Full text

Pdf (874 KB)

Source

Annual Workshop on Computational Learning Theory archive
Proceedings of the eleventh annual conference on Computational learning theory table of contents

Madison, Wisconsin, United States

Pages: 56 - 63

Year of Publication: 1998

ISBN:1-58113-057-0

Author

Jochen Nessel

Universität Kaiserslautern, FB Informatik, Postfach 3049, 67653 Kaiserslautern

Sponsors

University of Wisconsin : University of Wisconsin
UC @ Santa Cruz : UC @ Santa Cruz
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 7, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/279943.279954 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	: Case, J., Smith, C.H. (1983), Comparison of Identification Criteria for Madfine Inductive Inference. Theoretical Cornputer Science 25, 193 - 220.
	2	Rūsiņš Freivalds , Efim Kinber , Carl H. Smith, On the impact of forgetting on learning machines, Journal of the ACM (JACM), v.42 n.6, p.1146-1168, Nov. 1995 [doi>10.1145/227683.227685]
	3	Rūsiņš Freivalds , Efim Kinber , Carl H. Smith, On the intrinsic complexity of learning, Information and Computation, v.123 n.1, p.64-71, Nov. 15, 1995 [doi>10.1006/inco.1995.1158]
	4	Hartley Rogers, Jr., Theory of recursive functions and effective computability, MIT Press, Cambridge, MA, 1987

CITED BY 2

	Efim Kinber , Christophe Papazian , Carl Smith , Rolf Wiehagen, On the intrinsic complexity of learning recursive functions, Proceedings of the twelfth annual conference on Computational learning theory, p.257-266, July 07-09, 1999, Santa Cruz, California, United States
	Sanjay Jain , Efim Kinber , Christophe Papazian , Carl Smith , Rolf Wiehagen, On the intrinsic complexity of learning recursive functions, Information and Computation, v.184 n.1, p.45-70, July 10, 2003