Co-learning of total recursive functions

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Co-learning of total recursive functions

Full text

Pdf (797 KB)

Source

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

New Brunswick, New Jersey, United States

Pages: 190 - 197

Year of Publication: 1994

ISBN:0-89791-655-7

Authors

Rūsiņš Freivalds	Department of Computer Science, University of Latvia, Raina bulvaris 29, LV-1459, Riga Latvia
Marek Karpinski	Department of Computer Science, University of Bonn, Römerstrasse 164, D-5300, Bonn 1 Germany
Carl H. Smith	Department of Computer Science, University of Maryland, College Park, MD

Sponsors

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): 11, Downloads (12 Months): 26, Citation Count: 3

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/180139.181098 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.

	AS83	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]
	Ersh74	Yu. L. Ershov. Theory of numberings, 1. Novosibirsk State University Publ., 1974 (Russian).
	Ersh77	Yu. L. Ershov. Theory of numberings. Nauka, Moscow, 1977 (Russian).
	Fre75	R. Freivalds. Minimal GSdel numbers and their identification in the limit. Lecture Notes in Computer Science, Springer, 32: 219-225, 1975.
	Fre91	Rusins Freivalds, Inductive Inference of Recursive Functions: Qualitative Theory, Baltic Computer Science, Selected Papers, p.77-110, January 1991
	MY78	Michael Machtey , Paul Young, An Introduction to the General Theory of Algorithms, Elsevier Science Inc., New York, NY, 1978
	Mal65	A. I. Malcev. Algorithms and Recursive Functions. Nauka, Moscow, 1965 (Russian).
	Rog87	Hartley Rogers, Jr., Theory of recursive functions and effective computability, MIT Press, Cambridge, MA, 1987
	Smi82	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]

CITED BY 3

	Kalvis Apsītis , Rīsiņš Freivalds , Raimonds Simanovskis , Juris Smotrovs, Closedness properties in ex-identification, Theoretical Computer Science, v.268 n.2, p.367-393, 17 October 2001
	Rusins Freivalds , Marek Karpinski , Carl H. Smith , Rolf Wiehagen, Learning by the process of elimination, Information and Computation, v.176 n.1, p.37-50, July 2002
	John Case , Sanjay Jain , Mandayam Suraj, Control structures in hypothesis spaces: the influence on learning, Theoretical Computer Science, v.270 n.1-2, p.287-308, January