Hostname: page-component-54dcc4c588-hp6zs Total loading time: 0 Render date: 2025-09-30T11:04:58.271Z Has data issue: false hasContentIssue false
  • English
  • Français

The structure of intrinsic complexity of learning

Published online by Cambridge University Press:  12 March 2014

Sanjay Jain  and
Arun Sharma
Sanjay Jain
Affiliation:
Department of Information Systems and Computer Science, National University of Singapore, Singapore 119260, Republic of Singapore E-mail: sanjay@iscs.nus.sg
Arun Sharma
Affiliation:
School of Computer Science and Engineering, The University of New South Wales, Sydney, NSW 2052, Australia, E-mail: arun@cse.unsw.edu.au
Get access Rights & Permissions [Opens in a new window]

Abstract

Limiting identification of r.e. indexes for r.e. languages (from a presentation of elements of the language) and limiting identification of programs for computable functions (from a graph of the function) have served as models for investigating the boundaries of learnability. Recently, a new approach to the study of “intrinsic” complexity of identification in the limit has been proposed. This approach, instead of dealing with the resource requirements of the learning algorithm, uses the notion of reducibility from recursion theory to compare and to capture the intuitive difficulty of learning various classes of concepts. Freivalds, Kinber, and Smith have studied this approach for function identification and Jain and Sharma have studied it for language identification.

The present paper explores the structure of these reducibilities in the context of language identification. It is shown that there is an infinite hierarchy of language classes that represent learning problems of increasing difficulty. It is also shown that the language classes in this hierarchy are incomparable, under the reductions introduced, to the collection of pattern languages.

Richness of the structure of intrinsic complexity is demonstrated by proving that any finite, acyclic, directed graph can be embedded in the reducibility structure. However, it is also established that this structure is not dense. The question of embedding any infinite, acyclic, directed graph is open.

Information

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 62 , Issue 4 , December 1997 , pp. 1187 - 1201
Copyright
Copyright © Association for Symbolic Logic 1997

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

REFERENCES

[1]Angluin, D., Finding patterns common to a set of strings, Journal of Computer and System Sciences, vol. 21 (1980), pp. 46–62.CrossRefGoogle Scholar
[2]Angluin, D., Inductive inference of formal languages from positive data, Information and Control, vol. 45 (1980), pp. 117–135.CrossRefGoogle Scholar
[3]Blum, M., A machine independent theory of the complexity of recursive functions, Journal of the ACM, vol. 14 (1967), pp. 322–336.CrossRefGoogle Scholar
[4]Case, J., Periodicity in generations of automata, Mathematical Systems Theory, vol. 8 (1974), pp. 15–32.CrossRefGoogle Scholar
[5]Freivalds, R., Inductive inference of recursive functions: Qualitative theory, Baltic computer science (Barzdins, J. and Bjorner, D., editors), Lecture Notes in Computer Science, vol. 502, Springer-Verlag, 1991, pp. 77–110.CrossRefGoogle Scholar
[6]Freivalds, R., Kinber, E., and Smith, C. H., On the intrinsic complexity of learning, Proceedings of the Second European Conference on Computational Learning Theory (Vitanyi, Paul, editor), Lecture Notes in Artificial Intelligence, vol. 904, Springer-Verlag, 03 1995, pp. 154–169.CrossRefGoogle Scholar
[7]Gold, E. M., Language identification in the limit, Information and Control, vol. 10 (1967), pp. 447–474.CrossRefGoogle Scholar
[8]Hopcroft, J. and Ullman, J., Introduction to automata theory languages and computation, Addison-Wesley Publishing Company, 1979.Google Scholar
[9]Jain, S. and Sharma, A., On the intrinsic complexity of language identification, Proceedings of the Seventh Annual Conference on Computational Learning Theory, New Brunswick, New Jersey, ACM-Press, 07 1994, pp. 278–286.CrossRefGoogle Scholar
[10]Jain, S. and Sharma, A., On the intrinsic complexity of language identification, Journal of Computer and System Sciences, vol. 52 (1996), pp. 393–402.CrossRefGoogle Scholar
[11]Machtey, M. and Young, P., An introduction to the general theory of algorithms, North Holland, New York, 1978.Google Scholar
[12]Rogers, H., Theory of recursive functions and effective computability, McGraw Hill, New York, 1967, reprinted, MIT Press, 1987.Google Scholar