Learning Recursive Functions from Approximations

Journal of Computer and System Sciences

Volumn 55, Issue 1, 1997, Pages 183-196

  Case, John ^a   Kaufmann, Susanne ^b   Kinber, Efim ^c   Kummer, Martin ^b  

^a University of Delaware   (United States)

^b UNIVERSITY OF KARLSRUHE   (Germany)

^c SACRED HEART UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING ALGORITHMS; LEARNING SYSTEMS; PROBABILITY; RECURSIVE FUNCTIONS;

FREQUENCY COMPUTATIONS;

COMPUTER SCIENCE;

EID: 0031211652     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1997.1508     Document Type: Article

References (44)

1. A. Amir and W. I. Gasarch, Polynomial terse sets, Inform. and Comput. 77 (1988), 37-56.
2. D. Angluin, W. I. Gasarch, and C. H. Smith, Training sequences, Theoret. Comput. Sci. 66 (1989), 255-272.
3. G. Baliga and J. Case, Learning with higher order additional information, in "Proceedings 4th AII'94," Lecture Notes in Computer Science, Vol. 872, pp. 64-75, Springer-Verlag, Berlin, 1994.
4. R. Beigel, W. I. Gasarch, J. Gill, and J. C. Owings, Jr., Terse, superterse, and verbose sets, Inform. and Comput. 103 (1993), 68-85.
5. R. Beigel, M. Kummer, and F. Stephan, Quantifying the amount of verboseness, Inform. and Comput. 118 (1995), 73-90.
6. R. Beigel, M. Kummer, and F. Stephan, Approximable sets, Inform. and Comput. 120 (1995), 304-314.
7. A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth, Learnability and the Vapnik-Chervonenkis dimension, Assoc. Comput. Mach. 36 (1989), 929-965.
8. R. Brooks and M. Mataric, Real robots, real learning problems, in "Robot Learning" (J. Connell and S. Mahadevan, Eds.), pp. 193-234, Kluwer Academic, Boston, 1993.
9. J. Case and C. H. Smith, Identification criteria for machine inductive inference, Theoret. Comput. Sci. 25 (1983), 193-220.
10. G. J. Chaitin, Program size, oracles, and the jump operation, Osaka J. Math. 14 (1977), 139-149.
11. K. Chang, A purely geometric module in the rat's spatial representation, Cognition 23 (1986), 149-178.
12. T. Dean, D. Angluin, K. Bayse, S. Engelson, L. Kaelbling, E. Kokkevis, and O. Maron, Inferring finite automata with stochastic output functions and an application to map learning, in "Proceedings Tenth National Conference on Artificial Intelligence, AAAI-92, Menlo Park, CA, 1992," pp. 208-214.
13. A. N. Degtev, On (m, n)-computable sets, in "Algebraic Systems" (D. I. Moldavanskij, Ed.), pp. 88-99, Ivanova Gos. Univ. Press, 1981, [in Russian] (see MR 86b:03049).
14. L. Fortnow, W. I. Gasarch, S. Jain, E. Kinber, M. Kummer, S. Kurtz, M. Pleszkoch, T. Slaman, R. Solovay, and F. Stephan, Extremes in the degrees of inferability, Ann. Pure Appl. Logic 66 (1994), 231-276.
15. R. V. Freivalds, Inductive inference of recursive functions: Qualitative theory, in "Baltic Computer Science," Lecture Notes in Computer Science, Vol. 502, pp. 77-110, Springer-Verlag, Berlin, 1991.
16. R. V. Freivalds and R. Wiehagen, Inductive inference with additional information, EIK 15 (1979), 179-185.
17. C. Gallistel, "The Organization of Learning," MIT Press, Cambridge, MA, 1990.
18. W. I. Gasarch and C. H. Smith, Learning via queries, Assoc. Comput. Mach. 39 (1992), 649-674.
19. V. Harizanov, M. Kummer, and J. C. Owings, Jr., Frequency computation and the cardinality theorem, J. Symbolic Logic 57 (1992), 677-681.
20. A. Hayashi and T. Dean, Locating a mobile robot using local observations and a global satellite map, in "Third International Symposium on Intelligent Control 1988," pp. 135-140, IEEE, Piscataway, NJ, 1988.
21. S. Kaufmann and M. Kummer, On a quantitative notion of uniformity, Fundamenta Inform. 25 (1996), 59-78; in "Proceedings MFCS'95," Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1995 [extended abstract].
22. S. Kaufmann and M. Kummer, On a quantitative notion of uniformity, Fundamenta Inform. 25 (1996), 59-78; in "Proceedings MFCS'95," Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1995 [extended abstract].
23. E. Kinber, On frequency calculations of general recursive predicates, Sov. Math. Dokl. 13 (1972), 873-876.
24. E. Kinber, "Frequency-Computable Functions and Frequency-Enumerable Sets," Candidate dissertation Riga, 1975. [in Russian]
25. B. Kuipers, Modeling spatial knowledge, Cognitive Sci. 2 (1978), 129-153.
26. B. Kuipers and Y. Byun, A robust, qualitative method for robot spatial reasoning, in "Proceedings Sixth National Conference on Artificial Intelligence AAAI-88," pp. 774-779.
27. M. Kummer, A proof of Beigel's cardinality conjecture, J. Symbolic Logic 57 (1992), 682-687.
28. M. Kummer and F. Stephan, Inclusion problems in parallel learning and games, J. Comput. System Sc., to appear; also, [extended abstract] in "Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, COLT'94," pp. 287-298, ACM Press, New York, 1994.
29. M. Kummer and F. Stephan, Inclusion problems in parallel learning and games, J. Comput. System Sc., to appear; also, [extended abstract] in "Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, COLT'94," pp. 287-298, ACM Press, New York, 1994.
30. M. Kummer and F. Stephan, The power of frequency computation, in "Proceedings FCT'95," Lecture Notes in Computer Science, Springer-Verlag, Berlin, 1995.
31. T. Lewitt, D. Lawton, D. Chelberg, and P. Nelson, Quantitative landmark-based path planning and following, in "Proceedings Fifth National Conference on Artificial Intelligence AAAI-87, 1987," pp. 689-694.
32. M. Li and P. Vitányi, "An Introduction to Kolmogorov Complexity and Its Applications," Springer-Verlag, Berlin, 1993.
33. D. W. Loveland, A variant of the Kolmogorov concept of complexity, Inform. and Control 15 (1969), 510-526.
34. J. Margules and C. Gallistel, Heading in the rat: Determination by environmental shape, Animal Learning and Behav. 16 ( 1988), 404-410.
35. M. Mataric, Integration of representation into goal-driven behavior-based robots, IEEE Trans. Robotics and Automation 8 (1992), 304-312.
36. D. McDermott, Robot planning, AI Magazine 13 (2) (1992), 55-79.
37. P. Odifreddi, "Classical Recursion Theory," North-Holland, Amsterdam, 1989.
38. D. Osherson, M. Stob, and S. Weinstein, "Systems that Learn," MIT Press, Cambridge, MA, 1986.
39. J. C. Owings, Jr., A cardinality version of Beigel's nonspeedup theorem, J. Symbolic Logic 54 (1989), 761-767.
40. L. Pitt, Probabilistic inductive inference, J. Assoc. Comput. Machin. 36 (1989), 383-433.
41. G. F. Rose, An extended notion of computability, in "Abstracts of the International Congress for the Logic, Methods, and Philosophy of Science," Stanford, CA, 1960.
42. C. H. Smith, The power of pluralism for automatic program synthesis, J. Assoc. Comput. Machin. 29 (1982), 1144-1165.
43. R. I. Soare, "Recursively Enumerable Sets and Degrees," Springer-Verlag, Berlin, 1987.
44. B. A. Trakhtenbrot, On frequency computation of functions, Algebra i Logika 2 (1963), 25-32. [in Russian]