Inclusion problems in parallel learning and games (extended abstract)

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Inclusion problems in parallel learning and games (extended abstract)

Full text

Pdf (1.31 MB)

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: 287 - 298

Year of Publication: 1994

ISBN:0-89791-655-7

Authors

Martin Kummer	Institut für Logik, Komplexität, und Deduktionssysteme, D-76128 Universität Karlsruhe, Germany
Frank Stephan	Institut für Logik, Komplexität, und Deduktionssysteme, D-76128 Universität Karlsruhe, Germany

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): 2, Downloads (12 Months): 16, Citation Count: 0

Additional Information:

references 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.181156 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	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]
	2	J. Case, C. Smith. Comparison of identification criteria for machine inductive inference. Theoretical Computer Science, 25:193-220, 1983.
	3	A. N. D~gtev. Solvability of the V3-theory of a certain factor-lattice of recursively enumerable degrees. Algebra and Logic, 17:94-101, 1978.
	4	A. N. D~gtev. On (m,n)-computable sets. In: Algebraic Systems (Edited by D.I. Moldavanskij). Ivanova Gos. Univ., pp. 88-99, 1981. (Russian) (MR 86b:03049)
	5	L. Fortnow, W. Gasarch, S. Jain, E. Kinber, M. Kummer, S. Kuxtz, M. Pleszkoch, T. Slaman, R. Solovay, F. Stephan. Extremes in the degrees of inferability. To appear in: Annals of Pure and Applied Logic.
	6	C. G. Jockusch, Jr. Degrees of functions with no fixed points. In: Logic, Methodology and Philosophy of Science VIII, pp. 191-201, Elsevier, Amsterdam, 1989.
	7	E. Kinber. Frequency computable functions and frequency enumerable sets. Candidate Dissertation, Riga 1975. (Russian)
	8	Efim Kinber , Carl H. Smith , Mahendran Velauthapillai , Rolf Wiehagen, On learning multiple concepts in parallel, Proceedings of the sixth annual conference on Computational learning theory, p.175-181, July 26-28, 1993, Santa Cruz, California, United States [doi>10.1145/168304.168328]
	9	E. Kinber, R. Wiehagen. Parallel learning - A recursion-theoretic approach. Informatik-Preprint 10, Fachbereich Iaformatik der Humboldt-Universit'it zu Berlin, Berlin, 1991.
	10	M. Kummer, F. Stephan. Some aspects of frequency computation. Technical Report 21/91, Fakultiit {dr Informatik, Universitiit Kaxlsruhe, Karlsruhe, 1991.
	11	Martin Kummer, The strength of noninclusions for teams of finite learners (extended abstract), Proceedings of the seventh annual conference on Computational learning theory, p.268-277, July 12-15, 1994, New Brunswick, New Jersey, United States [doi>10.1145/180139.181144]
	12	A. Lachlan. On some games which axe relevant to the theory of recursively enumerable sets. Annals of Math. (Ser. ~), 91:291-310, 1970.
	13	R. McNaughton. Infinite games played on finite graphs. Annals of Pure and Applied Logic, 65:149- 184, 1993.
	14	P. Odifreddi. Classical reeursion theory. North- Holland, Amsterdam, 1989.
	15	D. Osherson, M. Stob, S. Weinstein. Systems that learn. MIT Pre~, Cambridge (MA), 1986.
	16	Robert I. Soare, Recursively enumerable sets and degrees, Springer-Verlag New York, Inc., New York, NY, 1987