Learning via queries and oracles

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Learning via queries and oracles

Full text

Pdf (866 KB)

Source

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

Santa Cruz, California, United States

Pages: 162 - 169

Year of Publication: 1995

ISBN:0-89791-723-5

Author

Frank Stephan

Institut für Logik, Komplexität und Deduktionssysteme, Universität Karlsruhe, 76128 Karlsruhe, Germany

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence
University of California : University of California

Publisher

ACM New York, NY, USA

Bibliometrics

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

Additional Information:

references cited by index terms collaborative colleagues peer to peer

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/225298.225317 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	L. Adleman, M. Blum. Inductive inference and unsolvability. Journal of Symbolic Logic, 56:891-900, 1991.
	2	Dana Angluin, Learning regular sets from queries and counterexamples, Information and Computation, v.75 n.2, p.87-106, November 1, 1987 [doi>10.1016/0890-5401(87)90052-6]
	3	Richard Beigel , William I. Gasarch , John Gill , James C. Owings, Terse, superterse, and verbose sets, Information and Computation, v.103 n.1, p.68-85, March 1993 [doi>10.1006/inco.1993.1014]
	4	J. Case, C. Smith. Comparison of identification criteria for machine inductive inference. Theoretical Computer Science, 25:193-220, 1983.
	5	L. Fortnow, W. Gasarch, S. Jain, E. Kinber, M. Kummer, S. Kurtz, M. Pleszkoch, T. Slaman, 1~. Solovay, F. Stephan. Extremes in the degrees of inferabitity. Annals of Pure and Applied Logic, 66:231-276, 1994.
	6	William I. Gasarch , Mark G. Pleszkoch, Learning via queries to an oracle, Proceedings of the second annual workshop on Computational learning theory, p.214-229, December 1989, Santa Cruz, California, United States
	7	W. Gasarch, M. Pleszkoch, R. Solovay. Learning via Queries in {+, <}. Journal of Symbolic Logic, 57(1):53-81, 1992.
	8	William I. Gasarch , Carl H. Smith, Learning via queries, Journal of the ACM (JACM), v.39 n.3, p.649-674, July 1992 [doi>10.1145/146637.146670]
	9	E. M. Gold. Language Identification in the limit. Information and Control, 10:447-474, 1967.
	10	C. Joekusch. Degrees of generic sets. In: London Mathematical Societey Lecture Notes, 45:110-139, 1981.
	11	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]
	12	D. B. Posner, R. W. Robinson. Degrees Joining to 0~. Journal of Symbolic Logic, 46(4):714-722, 1981.
	13	P. Odifreddi. Classical recuvsion theory. North- Holland, Amsterdam, 1989.
	14	D. Osherson, M. Stob, S. Weinstein. Systems that learn. MIT Press, Cambridge (MA), 1986.
	15	Theodore A. Slaman , Robert Solovay, When oracles do not help, Proceedings of the fourth annual workshop on Computational learning theory, p.379-383, August 05-07, 1991, Santa Cruz, California, United States
	16	Robert I. Soare, Recursively enumerable sets and degrees, Springer-Verlag New York, Inc., New York, NY, 1987

CITED BY 2

	William Gasarch , Mark G. Pleszkoch , Frank Stephan , Mahendran Velauthapillai, Classification using information, Annals of Mathematics and Artificial Intelligence, v.23 n.1-2, p.147-168, 1998
	William I. Gasarch , Andrew C. Y. Lee, Inferring answers to queries, Proceedings of the tenth annual conference on Computational learning theory, p.275-284, July 06-09, 1997, Nashville, Tennessee, United States