On the inductive inference of recursive real-valued functions

Theoretical Computer Science

Volumn 219, Issue 1-2, 1999, Pages 3-17

  Apsitis, Kalvis ^a   Arikawa, Setsuo ^b   Freivalds, Rusiņš ^c   Hirowatari, Eiju ^b   Smith, Carl H ^a  

^a Institute of Advanced Computer Science   (United States)

^b KYUSHU UNIVERSITY   (Japan)

^c UNIVERSITY OF LATVIA   (Latvia)

Author keywords

Inductive inference; Learning theory; Real valued computation

Indexed keywords

EID: 0038222307     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00281-3     Document Type: Article

References (9)

1. D. Angluin, C.H. Smith, Inductive inference: theory and methods, Comput. Surveys 15 (1983) 237-269.
2. J. Case, C. Smith, Comparison of identification criteria for machine inductive inference, Theoret. Comput. Sci. 25(2) (1983) 193-220.
3. R. Daley, L. Pitt, M. Velauthapillai, T. Will, Relations between probabilistic and team one-shot learners, in: M. Warmuth, L. Valiant (Eds.), Proc. 1991 Workshop on Computational Learning Theory, Kaufmann, Palo Alto, CA, 1991, pp. 228-239.
4. W. Gasarch, C. Smith, Learning via queries, J. Assoc. Comput. Mach. 39 (1992) 649-674.
5. E.M. Gold, Language identification in the limit, Inform, and Control 10 (1967) 447-474.
6. M. Machtey, P. Young, An Introduction to the General Theory of Algorithms, North-Holland, New York, 1978.
7. A. Mukherjea, K. Pothoven, Real and Functional Analysis, Plenum Press, New York, 1978.
8. M.B. Pour-El, J.I. Richards, Computability in Analysis and Physics, Perspectives in Mathematical Logic, Springer, Berlin, 1989.
9. C. Smith, A Recursive Introduction to the Theory of Computation, Springer, Berlin, 1994.