Trees and learning

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Trees and learning

Full text

Pdf (1.10 MB)

Source

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

Desenzano del Garda, Italy

Pages: 270 - 279

Year of Publication: 1996

ISBN:0-89791-811-8

Authors

Wolfgang Merkle	Universität Heidelberg, Mathematisches Institut, Im Neuenheimer Feld 294, 69120 Heidelberg, Germany, EU
Frank Stephan	Universität Heidelberg, Mathematisches Institut, Im Neuenheimer Feld 294, 69120 Heidelberg, Germany, EU

Sponsors

Univ degli Studi de Milano : Universite degli Studi de Milano
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: 3

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions 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/238061.238118 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	Dana Angluin , Carl H. Smith, Inductive Inference: Theory and Methods, ACM Computing Surveys (CSUR), v.15 n.3, p.237-269, Sept. 1983 [doi>10.1145/356914.356918]
	2	L. Blum and M. Blum: Towards a mathematical notion of inductive inference. Information and Control 28 (1975) 125-155.
	3	John Case , Susanne Kaufmann , Efim B. Kinber , Martin Kummer, Learning recursive functions from approximations, Proceedings of the Second European Conference on Computational Learning Theory, p.140-153, March 13-15, 1995
	4	J. Case and C. H. Smith: Comparison of identification criteria for machine inductive inference, Theoretical Computer Science 25 (1983) 193-220.
	5	R. V. Freivalds and R. Wiehagen: Inductive inference with additional information. Elektronische Informationsverarbeitung und Kybernetik 15 (1979) 179-185.
	6	E. M. Gold: Language identification in the limit, Information and Control 10 (1967) 447-474.
	7	P. Odifreddi: Classical recursion theory. North-Holland, Amsterdam (1989).
	8	Martin Kummer , Frank Stephan, On the structure of degrees of inferability, Proceedings of the sixth annual conference on Computational learning theory, p.117-126, July 26-28, 1993, Santa Cruz, California, United States [doi>10.1145/168304.168319]
	9	K. M. Podnieks: Comparing various concepts of function prediction, Part I. Udenye Zapiski Latvijskovo Umversitet 210 (1974) 68-81 (in Russian).
	10	Daniel N. Osherson , Michael Stob , Scott Weinstein, Systems that learn: an introduction to learning theory for cognitive and computer scientists, MIT Press, Cambridge, MA, 1986
	11	Leonard Pitt , Carl H. Smith, Probability and plurality for aggregations of learning machines, Information and Computation, v.77 n.1, p.77-92, April 1988 [doi>10.1016/0890-5401(88)90046-6]
	12	Carl H. Smith, Three Decades of Team Learning, Proceedings of the 4th International Workshop on Analogical and Inductive Inference: Algorithmic Learning Theory, p.211-228, October 10-15, 1994
	13	Robert I. Soare, Recursively enumerable sets and degrees, Springer-Verlag New York, Inc., New York, NY, 1987
	14	Rolf Wiehagen, A Thesis in Inductive Inference, Proceedings of the 1st International Workshop on Nonmonotonic and Inductive Logic, p.184-207, December 04-07, 1990
	15	R. Wiehagen and H. Jung: Recursiontheoretic characterizations of identifyable classes of recursive functions. Elektronische Informationsverarbeitung und Kybernetik 18 (1977) 385-397 (in German).
	16	R. Wiehasen and W. Liepke: Characteristic properties of identifyable classes of recursive functions. Elektronische Informatzonsverarbeitung und Kybernetik 12 (1976) 421-438 (in German).

CITED BY 3

	Matthias Ott , Frank Stephan, Avoiding coding tricks by hyperrobust learning, Theoretical Computer Science, v.284 n.1, p.161-180, 6 July 2002
	Arun Sharma , Frank Stephan , Yuri Ventsov, Generalized notions of mind change complexity, Proceedings of the tenth annual conference on Computational learning theory, p.96-108, July 06-09, 1997, Nashville, Tennessee, United States
	Arun Sharma , Frank Stephan , Yuri Ventsov, Generalized notions of mind change complexity, Information and Computation, v.189 n.2, p.235-262, March 15, 2004