Reductions for learning via queries

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Reductions for learning via queries

Full text

Pdf (952 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: 152 - 161

Year of Publication: 1995

ISBN:0-89791-723-5

Authors

William Gasarch	Dept. of Computer Science and Institute for Advanced Studies, University of Maryland, College Park, MD
Geoffrey R. Hird	Odyssey Research Associates, 301 Dates Drive, Ithaca, NY

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): 8, Citation Count: 1

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/225298.225316 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	J. Bfichi. Weak second order arithmetic and finite automata. Zeitsch. f. mafh. Logik und Grundlagen d. Math., 6:66-92, 1960.
	2	J. Bfichi. On a decision method in restricted second-order arithmetic. In Proc. of the International Congress on logic, Math, and Philosophy of Science (1960). Standford University Press, 1962.
	3	J. Case and C. Smith. Comparison of identification criteria for machine inductive inference. Theoretical Comput. Scz., 25:193 220, 1983.
	4	C. C. Elgot and M. O. Rabin. Decidability and undecidability of extensions of second (first) order theory of (generalized) successor. Journal of Symbohc Logic, 31(2):169-181, June 1966.
	5	W. Gasarch, M. Pleszkoch, and R. Solovay. Learning via queries to {+, <}. Journal of Symbolic Logic, 57(1):53-81, Mar. 1992.
	6	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]
	7	William I. Gasarch , Mahendran Velauthapillai, Asking Questions Versus Verifiability, Proceedings of the International Workshop on Analogical and Inductive Inference, p.197-213, October 05-09, 1992
	8	M. O. Rabin. Decidable theories. In J. Barwise, editor, Handbook of Mathematical Logic. North Holland, 1977.
	9	Carl H. Smith, The Power of Pluralism for Automatic Program Synthesis, Journal of the ACM (JACM), v.29 n.4, p.1144-1165, Oct. 1982 [doi>10.1145/322344.322356]
	10	Wolfgang Thomas, Automata on infinite objects, Handbook of theoretical computer science (vol. B): formal models and semantics, MIT Press, Cambridge, MA, 1991