Abstract
In the standard literature on inductive inference, a learner sees as input the course of values of the function to be learned. In the present work, it is investigated how reasonable this choice is and how sensitive the model is with respect to variations like the overgraph or undergraph of the function. Several implications and separations are shown and for the basic notions, a complete picture is obtained. Furthermore, relations to oracles, additional information and teams are explored.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adleman, L., Blum, M.: Inductive inference and unsolvability. Journal of Symbolic Logic 56, 891–900 (1991)
Angluin, D.: Inductive inference of formal languages from positive data. Information and Control 45, 117–135 (1980)
Blum, L., Blum, M.: Towards a mathematical theory of inductive inference. Information and Control 28, 125–155 (1975)
Fortnow, L., Gasarch, W., Jain, S., Kinber, E., Kummer, M., Kurtz, S., Pleszkoch, M., Slaman, T., Solovay, R., Stephan, F.: Extremes in the degrees of inferability. Annals of Pure. and Applied Logic 66, 231–276 (1994)
Gold, M.: Language identification in the limit. Information and Control 10, 447–474 (1967)
Jain, S., Sharma, A.: On the non-existence of maximal inference degrees for language identification. Information Processing Letters 47, 81–88 (1993)
Jain, S., Sharma, A.: Computational limits on team identification of languages. Information and Computation 130(1), 19–60 (1996)
Kummer, M., Stephan, F.: On the structure of degrees of inferability. Journal of Computer and System Sciences, Special Issue COLT (1993) 52, 214–238 (1996)
Odifreddi, P.: Classical Recursion Theory. North-Holland, Amsterdam (1989)
Osherson, D., Stob, M., Weinstein, S.: Systems That Learn, An Introduction to Learning Theory for Cognitive and Computer Scientists. In: Bradford, The MIT Press, Cambridge, Massachusetts (1986)
Pitt, L., Smith, C.H.: Probability and plurality for aggregations of learning machines. Information and Computation 77, 77–92 (1988)
Soare, R.: Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets. Springer, Heidelberg (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jain, S., Martin, E., Stephan, F. (2007). Input-Dependence in Function-Learning. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds) Computation and Logic in the Real World. CiE 2007. Lecture Notes in Computer Science, vol 4497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73001-9_39
Download citation
DOI: https://doi.org/10.1007/978-3-540-73001-9_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73000-2
Online ISBN: 978-3-540-73001-9
eBook Packages: Computer ScienceComputer Science (R0)