Choosing a learning team

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Choosing a learning team: a topological approach

Full text

Pdf (606 KB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing table of contents

Montreal, Quebec, Canada

Pages: 283 - 289

Year of Publication: 1994

ISBN:0-89791-663-8

Authors

Kalvis Apsītis	Institute of Mathematics and Computer Science, University of Latvia, Raina bulväris 29, LV-1459, Riga, Latvia
Rūsiņš Freivalds	Institute of Mathematics and Computer Science, University of Latvia, Raina bulväris 29, LV-1459, Riga, Latvia
Carl H. Smith	Department of Computer Science, University of Maryland, College Park, MD

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

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

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

	BB75	L. Blum and M. Blum. Toward a mathematical theory of inductive inference. Information and Control, 28:125-155, 1975.
	CS78	John Case , Carl Smith, Anomaly hierarchies of mechanized inductive inference, Proceedings of the tenth annual ACM symposium on Theory of computing, p.314-319, May 01-03, 1978, San Diego, California, United States [doi>10.1145/800133.804360]
	CS83	J. Case and C. Smith. Comparison of identification criteria for machine inductive inference. Theoretical Computer Science, 25(2):193-220,1983.
	DKV92	Robert Daley , Bala Kalyanasundaram , Mahendran Velauthapillai, Breaking the probability ½ barrier in FIN-type learning, Proceedings of the fifth annual workshop on Computational learning theory, p.203-217, July 27-29, 1992, Pittsburgh, Pennsylvania, United States [doi>10.1145/130385.130408]
	DKV93	Robert Daley , Bala Kalyanasundaram , Mahendran Velauthapillai, Capabilities of fallible FINite learning, Proceedings of the sixth annual conference on Computational learning theory, p.199-208, July 26-28, 1993, Santa Cruz, California, United States [doi>10.1145/168304.168332]
	DPVW91	Robert Daley , Leonard Pitt , Mahendran Velauthapillai , Todd Will, Relations between probabilistic and team one-shot learners (extended abstract), Proceedings of the fourth annual workshop on Computational learning theory, p.228-239, August 05-07, 1991, Santa Cruz, California, United States
	DS86	Robert P Daley , Carl H Smith, On the complexity of inductive inference, Information and Control, v.69 n.1-3, p.12-40, April/May/June 1986 [doi>10.1016/S0019-9958(86)80042-0]
	Eng89	R. Engelking. General Topology. tteldermann Verlag, Berlin, 1989.
	FSV89	Rūsiņš Freivalds , C. H. Smith , M. Velauthapillai, Trade-off among parameters affecting inductive inference, Information and Computation, v.82 n.3, p.323-349, Sep. 1989 [doi>10.1016/0890-5401(89)90005-9]
	FW79	R.V. Freivalds and R. Wiehagen. Inductive inference with additional information. Elek#ronische Informa#ionsverabeitung und Kyberne#ik, 15(4):179-184, 1979.
	Gol67	E.M. Gold. Language identification in the limit. Information and Control, 10:447-474, 1967.
	Kel57	J.L. Kelly. General Topology. D. Van Nostrand Company, Inc, Princeton, New Jersey, 1957.
	KZ91	Efim Kinber , Thomas Zeugmann, One-sided error probabilistic inductive inference and reliable frequency identification, Information and Computation, v.92 n.2, p.253-284, June 1991 [doi>10.1016/0890-5401(91)90011-P]
	OSW86	Daniel N. Osherson , Michael Stob , Scott Weinstein, Aggregating inductive expertise, Information and Control, v.70 n.1, p.69-95, July 1986 [doi>10.1016/S0019-9958(86)80025-0]
	Pit89	L. Pitt, Probabilistic inductive inference, Journal of the ACM (JACM), v.36 n.2, p.383-433, April 1989 [doi>10.1145/62044.62053]
	PS88	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]
	Sch86	Gisela Schäfer, Some results in the theory of effective program synthesis: learning by defective information, Proceedings of the International Spring School on Mathematical Methods of Specification and Synthesis of Software Systems '85, p.219-225, April 22-26, 1985
	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]
	tFK+92	Kalvis Apsitis , Rusins Freivalds , Martins Krikis , Raimonds Simanovskis , Juris Smotrovs, Unions of Identifiable Classes of Total Recursive Functions, Proceedings of the International Workshop on Analogical and Inductive Inference, p.99-107, October 05-09, 1992

CITED BY 2

	Andris Ambainis, Probabilistic and team PFIN-type learning: general properties, Proceedings of the ninth annual conference on Computational learning theory, p.157-168, June 28-July 01, 1996, Desenzano del Garda, Italy
	Thomas Zeugmann , Sandra Zilles, Learning recursive functions: A survey, Theoretical Computer Science, v.397 n.1-3, p.4-56, May, 2008