Counting extensional differences in BC-learning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1891, Issue , 2000, Pages 256-269

  Stephan, Frank ^a   Terwijn, Sebastiaan A ^b  

^a UNIVERSITY OF HEIDELBERG   (Germany)

^b VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

Behaviourally correct learning; Inductive inference; Models of grammar induction

Indexed keywords

COMPUTATIONAL GRAMMARS; INFERENCE ENGINES; SEMANTICS;

BEHAVIOURALLY CORRECT LEARNING; FUNCTION LEARNING; GRAMMAR INDUCTION; INDUCTIVE INFERENCE; LANGUAGE LEARNING; MIND CHANGES; TEAM LEARNING;

LEARNING SYSTEMS;

EID: 84974697650     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45257-7_21     Document Type: Conference Paper

References (20)

1. A. Ambainis, S. Jain, and A. Sharma, Ordinal mind change complexity of language identification, Proceedings of the Third European Conference on Computational Learning Theory, Springer Lecture Notes in A. I. 1208 (1997) 301-316.
2. A. Ambainis, R. Freivalds, and C. H. Smith, Inductive Inference with Procrastination: Back to Definitions, Fundamenta Informaticae 40 (1999) 1-16.
3. D. Angluin, Inductive inference of formal languages from positive data, Information and Control 45 (1980) 117-135.
4. J. M. Bārzdins, Two theorems on the limiting synthesis of functions, Theory of Algorithms and Programs (Latvian State University) 1 (1974) 82-88 (in Russian).
5. J. M. Bārzdins and R. Freivalds, On the prediction of general recursive functions, Soviet Mathematics Doklady 13 (1972) 1224-1228.
6. L. Blum and M. Blum, Toward a mathematical theory of inductive inference, Information and Control 28 (1975) 125-155.
7. J. Case, S. Jain, and A. Sharma, Complexity issues for vacillatory function identification, Information and Computation 116(2) (1995) 174-192.
8. J. Case and C. Smith, Comparison of identification criteria for machine inductive inference, Theoretical Computer Science 25 (1983) 193-220.
9. R. Freivalds and C. Smith, On the role of procrastination in machine learning, Information and Computation 107 (1993), 237-271.
10. E. M. Gold, Language identification in the limit, Information and Control 10 (1967) 447-474.
11. S. Jain, D. Osherson, J. S. Royer, and A. Sharma, Systems that learn, An introduction to learning theory, second edition, MIT Press, 1999.
12. M. J. Kearns, U. V. Vazirani, An introduction to computational learning theory, MIT Press, 1994.
13. M. Kummer and F. Stephan, On the structure of degrees of inferability, Journal of Computer and System Sciences 52 (1996) 214-238.
14. P. Odifreddi, Classical Recursion Theory, North-Holland, Amsterdam, 1989.
15. P. Odifreddi, Inductive inference of total functions, in: S. B. Cooper, T. A. Sla- man, S. S. Wainer (eds.), Computability, Enumerability, Unsolvability. Directions in Recursion Theory, London Math. Soc. Lecture Note Series 224 (1996) 259-288.
16. D. N. Osherson, M. Stob, and S. Weinstein, Aggregating inductive expertise, Information and Computation 70(1) (1986) 69-95.
17. A. Sharma, F. Stephan, Y. Ventsov, Generalized notions of mind change complexity, Proceedings of the Tenth Conference on Computational Learning Theory (COLT’97), Nashville (1997) 96-108.
18. C. Smith, The power of pluralism for automatic program synthesis, J. ACM 29, Vol. 4 (1982) 1144-1165.
19. R. I. Soare, Recursively enumerable sets and degrees, Springer-Verlag, 1987.
20. S. A. Terwijn, Extensional set learning, Proceedings of The Twelfth Annual Conference on Computational Learning Theory (COLT ’99), Santa Cruz (1999) 243-248.