Inclusion problems in parallel learning and games (extended abstract)

Proceedings of the Annual ACM Conference on Computational Learning Theory

Volumn Part F129415, Issue , 1994, Pages 287-298

  Kummer, Martin ^a   Stephan, Frank ^a  

^a UNIVERSITY OF KARLSRUHE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84943260181     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/180139.181156     Document Type: Conference Paper

References (16)

1. R. Beigel, W. Gasarch, J. Gill, J. Owings. Terse, superterse, and verbose sets. Information and Computation, 103:68-85, 1993.
2. J. Case, C. Smith. Comparison of identification criteria for machine inductive inference. Theoretical Computer Science, 25:193-220, 1983.
3. A. N. Degtev. Solvability of the V3-theory of a certain factor-lattice of recursively enumerable degrees. Algebra and Logic, 17:94-101, 1978.
4. A. N. Degtev. 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. Kurtz, 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. E. Kinber, C. Smith, M. Velauthapillai, R. Wieha-gen. On learning multiple concepts in parallel. In: Proceedings of the Sixth Annual ACM Conference on Computational Learning Theory-COLT'93, pp. 175-181, ACM-Press, New York, 1993.
9. E. Kinber, R. Wiehagen. Parallel learning-A recursion-theoretic approach. Informatik-Preprint 10, Fachbereich Informatik der Humboldt-Univer-sitat zu Berlin, Berlin, 1991.
10. M. Kummer, F. Stephan. Some aspects of frequency computation. Technical Report 21/91, Fakultat fur Informatik, Universitat Karlsruhe, Karlsruhe, 1991.
11. M. Kummer. The strength of noninclusions for teams of finite learners. In: These Proceedings.
12. A. Lachlan. On some games which are relevant to the theory of recursively enumerable sets. Annals of Math. (Ser. 2), 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 recursion theory. North-Holland, Amsterdam, 1989.
15. D. Osherson, M. Stob, S. Weinstein. Systems that learn. MIT Press, Cambridge (MA), 1986.
16. R. I. Soare. Recursively enumerable sets and degrees. Springer-Verlag, Berlin, 1987.