๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the Intrinsic Complexity of Learning

โœ Scribed by R. Freivalds; E. Kinber; C.H. Smith

Book ID
112252186
Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
740 KB
Volume
123
Category
Article
ISSN
0890-5401

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Intrinsic complexity of learning geometr
Intrinsic complexity of learning geometrical concepts from positive data
โœ Sanjay Jain; Efim Kinber ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 666 KB

Intrinsic complexity is used to measure the complexity of learning areas limited by broken-straight lines (called open semi-hulls) and intersections of such areas. Any strategy learning such geometrical concepts can be viewed as a sequence of primitive basic strategies. Thus, the length of such a se

Language Learning from Texts: Degrees of
Language Learning from Texts: Degrees of Intrinsic Complexity and Their Characterizations
โœ Sanjay Jain; Efim Kinber; Rolf Wiehagen ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 338 KB

This paper deals with two problems: (1) what makes languages learnable in the limit by natural strategies of varying hardness, and (2) what makes classes of languages the hardest ones to learn. To quantify hardness of learning, we use intrinsic complexity based on reductions between learning problem

The Intrinsic Complexity of Language Ide
The Intrinsic Complexity of Language Identification
โœ Sanjay Jain; Arun Sharma ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 522 KB

A new investigation of the complexity of language identification is undertaken using the notion of reduction from recursion theory and complexity theory. The approach, referred to as the intrinsic complexity of language identification, employs notions of ``weak'' and ``strong'' reduction between lea