On the relative sizes of learnable sets

Theoretical Computer Science

Volumn 197, Issue 1-2, 1998, Pages 139-156

  Fortnow, Lance ^a   Freivalds, Rüsiņš ^b   Gasarch, William I ^e   Kummer, Martin ^d   Kurtz, Stuart A ^a   Smith, Carl H ^c   Stephan, Frank ^e  

^a THE UNIVERSITY OF CHICAGO   (United States)

^b UNIVERSITY OF LATVIA   (Latvia)

^c University of Maryland ^*  (United States)

^d UNIVERSITY OF KARLSRUHE   (Germany)

^e UNIVERSITY OF HEIDELBERG   (Germany)

Author keywords

Category; Inductive inference; Measure

Indexed keywords

EID: 0004506309     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00175-8     Document Type: Article

References (36)

1. D. Angluin, C.H. Smith, Inductive inference: theory and methods, Comput. Surveys 15 (1983) 237-269.
2. J. Bärzdinš, Two theorems on the limiting synthesis of functions, in: Bärzdinš (E.d.), Theory of Algorithms and Programs, vol. 1. Latvian State University, Riga, U.S.S.R., 1974, pp. 82-88.
3. S. Ben-David, L. Gurvits, A note on VC-dimension and measure of sets of reals, Proc. 8th Annual Workshop on Computational Learning Theory, ACM Press, New York, 1995, pp. 454-461.
4. L. Blum, M. Blum, Toward a mathematical theory of inductive inference. Inform. and Control 28 (1975) 125-155.
5. A. Blumer, A. Ehrenfeucht, D. Haussler, M.K. Warmuth, Learnability and the Vapnik Chervonenkis dimension. J. ACM 36 (4) (1989) 929-965.
6. E. Borel, Leçons sur les fonctions de variables réeles, Gauthier-Villars, Paris, 1905.
7. E. Borel, Leçons sur la théorie des fonctions, Gauthier-Villars, Paris, 1914.
8. J. Case, C. Smith, Comparison of identification criteria for machine inductive inference. Theoret. Comput. Sci. 25 (2) (1983) 193-220.
9. R. Daley, B. Kalyanasundaram, M. Velauthapillai, Breaking the probability 1/2 barrier in fin-type learning, Proc. 5th Annual Workshop on Computational Learning Theory, ACM Press, New York, 1992, pp. 203-217.
10. R. Daley, B. Kalyanasundaram, M. Velauthapillai, Capabilities of fallible finite learning, Proc. 6th Annual Workshop on Computational Learning Theory, ACM Press, New York, 1993, pp 199-208.
11. R. Daley, L. Pitt, M. Velauthapillai, T. Will, Relations between probabilistic and team one-shot learners, Proc. 5th Annual Workshop on Computational Learning Theory, Morgan Kaufmann, 1992, Los Altos, CA, pp. 228-239.
12. S. Fenner, Notions of resource-bounded category and genericity, Proc. 6th Annual Conf. on Structure in Complexity Theory, IEEE Computer Soc. Press, Silver Spring, MD, 1991, pp. 196-212.
13. R. Freivalds, M. Karpinski, C. Smith, Co-learning of total recursive functions, Proc. 7th Annual Workshop on Computational Learning Theory, ACM Press, New York, 1994, pp. 190-197.
14. E.M. Gold, Language identification in the limit, Inform. and Control 10 (1967) 447-474.
15. W. Gasarch, C.H. Smith, Learning via queries, J. ACM 39 (3) (1992) 649-675, A shorter version is in 29th FOCS Conf., 1988, pp. 130-137.
16. W. Gasarch, C.H. Smith, Learning via queries, J. ACM 39 (3) (1992) 649-675, A shorter version is in 29th FOCS Conf., 1988, pp. 130-137.
17. S. Jain, A. Sharma, Finite learning by a team, Proc. 3rd Annual Workshop on Computational Learning Theory, Morgan Kaufmann, Los Altos, CA, 1990, pp. 163-177.
18. C. Kuratowski, Topologie, vol. 1, 4th ed., Monografie Matematyezne, vol. 20, Panstwowe Wydawnietwo Naukowe, 1958.
19. C. Kuratowski, Topologie, vol. 1, 4th ed., Monografie Matematyezne, vol. 20, Panstwowe Wydawnietwo Naukowe, 1958.
20. L. Lisagor, The Banach-Mazur game, Matematicheskij Sbornik 38 (1981) 201-206 (translated version).
21. J. Lutz, Almost everywhere high nonuniform complexity. J. Comput. Systems Sci. 44 (1992) 226-258.
22. J. Lutz, The quantitative structure of exponential time, in: Proc. 8th Annual Conf. on Structure in Complexity Theory Conf., IEEE Computer Soc. Press, Silver Spring, MD, 1993, pp. 158-175.
23. M. Machtey, P. Young, An Introduction to the General Theory of Algorithms, North-Holland, New York, 1978.
24. K. Mehlhorn, On the size of sets of computable functions, Proc. 14th Annual Symp. on Switching and Automata Theory, IEEE Computer Soc. Press, Silver Spring, MD, 1973, pp. 190-195.
25. D.N. Osherson, M. Stob, S Weinstein, Aggregating inductive expertise, Inform. and Control 70 (1986) 69-95.
26. J. Oxtoby, Measure and Category, Springer, Berlin, 1971.
27. L. Pitt, Probabilistic inductive inference, J. ACM 36 (2) (1989) 383-433.
28. L. Pitt, C. Smith, Probability and plurality for aggregations of learning machines, Inform. and Comput. 77 (1988) 77-92.
29. H. Putnam, Probability and confirmation, in: Mathematics, Matter and Method. vol. 1, Cambridge University Press, Cambridge, 1975.
30. H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York, 1967.
31. C.P. Schnorr, Zufälligkeit and Wahrscheinlichkeit, Lecture Notes in Mathematics, vol. 218, Springer, Berlin, 1971.
32. C.H. Smith, The power of pluralism for automatic program synthesis, J. ACM 29 (4) (1982) 1144-1165.
33. C. Smith, A Recursive Introduction to the Theory of Computation, Springer, Berlin, 1994.
34. R.I. Soare, Recursively Enumerable Sets and Degrees, Perspectives in Mathematical Logic, Springer, Berlin, 1987.
35. S.A. Terwijn, private communication, August 1995.
36. M. Velauthapillai, Inductive inference with a bounded number of mind changes, Proc. 2nd Annual Workshop on Computational Learning Theory, Palo, Morgan Kaufmann, Los Altos, CA, 1989, pp. 200-213.