Probabilistic and team PFIN-type learning

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Probabilistic and team PFIN-type learning: general properties

Full text

Pdf (1.06 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: 157 - 168

Year of Publication: 1996

ISBN:0-89791-811-8

Author

Andris Ambainis

Institute of Mathematics and Computer Science, University of Latvia, Raina bulv. 29, Riga, Latvia and Riga Institute of Information Technology

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): 17, Downloads (12 Months): 22, Citation Count: 1

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.238087 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	Andris Ambainis, The power of procrastination in inductive inference: How it depends on used ordinal notations, Proceedings of the Second European Conference on Computational Learning Theory, p.99-111, March 13-15, 1995
	2	Kalvis Apsitis, Topological Considerations in Composing Teams of Learning Machines, Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, p.146-154, January 1995
	3	Kalvis Apsītis , Rūsiņš Freivalds , Carl H. Smith, Choosing a learning team: a topological approach, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.283-289, May 23-25, 1994, Montreal, Quebec, Canada [doi>10.1145/195058.195158]
	4	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]
	5	A. Church, The constructive second number class. Bulletin American Mathematical Society, vol. 44(1938), pp.224-232
	6	A. Church, S. Kleene, Formal definitions in the theory of ordinal numbers. Fund. Math., vol. 28(1937), pp.11-21
	7	Robert P. Daley , Bala Kalyanasundaram, Use of Reduction Arguments in Determining Popperian FIN-Type Learning Capabilities, Proceedings of the 4th International Workshop on Algorithmic Learning Theory, p.173-186, November 08-10, 1993
	8	Robert P. Daley , Bala Kalyanasundaram, Towards Reduction Argumentf for FINite Learning, Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, p.63-75, January 1995
	9	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]
	10	Robert P. Daley , Bala Kalyanasundaram , Mahendran Velauthapillai, The Power of Probabilism in Popperian FINite Learning (extended abstract), Proceedings of the International Workshop on Analogical and Inductive Inference, p.151-169, October 05-09, 1992
	11	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
	12	R. Freivalds, Finite identification of general recursire functions by probabilistic strategies. Proceedings of the Conference on Algebraic, Arithmetic and Categorical Methods in Computation Theory, pp. 138-145. Akademie-Verlag, Berlin, 1979
	13	Rūsiņš Freivalds , Carl H. Smith, On the role of procrastination in machine learning, Information and Computation, v.107 n.2, p.237-271, Dec. 1993 [doi>10.1006/inco.1993.1068]
	14	E. M. Gold, Language identification in the limit. Information and Control, vol. 10(1967), pp.447-477
	15	Sanjay Jain , Arun Sharma, Finite learning by a “team”, Proceedings of the third annual workshop on Computational learning theory, p.163-177, August 06-08, 1990, Rochester, New York, United States
	16	Sanjay Jain , Arun Sharma, Probability is more powerful than team for language identification from positive data, Proceedings of the sixth annual conference on Computational learning theory, p.192-198, July 26-28, 1993, Santa Cruz, California, United States [doi>10.1145/168304.168331]
	17	S. Jain, A.Sharma, Computational limits on team identification of languages. Techlnlcal Report 9301, School of Computer Science and Engineering, University of New South Wales, 1993.
	18	Sanjay Jain , Arun Sharma, On Identification by Teams and Probabilistic Machines, Algorithmic Learning for Knowledge-Based Systems, GOSLER Final Report, p.108-145, January 1995
	19	S. Kleene, On notation for ordinal numbers. Journal Symbolic Logic, vol. 3(1938), pp.150-155
	20	Michael Machtey , Paul Young, An Introduction to the General Theory of Algorithms, Elsevier Science Inc., New York, NY, 1978
	21	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
	22	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]
	23	H. Rogers Jr., Godel numberings of partial recursive functions. Journal of Symbolic Logic, vol. 23(1958), pp. 331-341
	24	Hartley Rogers, Jr., Theory of recursive functions and effective computability, MIT Press, Cambridge, MA, 1987
	25	W. Sierpinski, Cardinal and ordinal numbers. PWN - Polish Scientific Publishers, 1965
	26	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
	27	Mahendran Velauthapillai, Inductive inference with bounded number of mind changes, Proceedings of the second annual workshop on Computational learning theory, p.200-213, December 1989, Santa Cruz, California, United States