The structure of intrinsic complexity of learning
DOI10.2307/2275636zbMATH Open0895.68121OpenAlexW2122008636MaRDI QIDQ4382469FDOQ4382469
Authors: Sanjay Jain, A. K. Sharma 
Publication date: 2 September 1998
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2275636
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Recursive functions and relations, subrecursive hierarchies (03D20)
Cites Work
- Inductive inference of formal languages from positive data
- Title not available (Why is that?)
- Language identification in the limit
- Finding patterns common to a set of strings
- A Machine-Independent Theory of the Complexity of Recursive Functions
- The intrinsic complexity of language identification
- Periodicity in generations of automata
Cited In (13)
- Induction by enumeration
- Intrinsic complexity of learning geometrical concepts from positive data
- An approach to intrinsic complexity of uniform learning
- How rich is the structure of the intrinsic complexity of learning
- On the intrinsic complexity of learning recursive functions
- Ordinal mind change complexity of language identification
- Intrinsic complexity of partial learning
- The information complexity of learning tasks, their structure and their distance
- Title not available (Why is that?)
- On the intrinsic complexity of learning
- Language learning from texts: Degrees of intrinsic complexity and their characterizations
- Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
- Mind change speed-up for learning languages from positive data
This page was built for publication: The structure of intrinsic complexity of learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4382469)
