The structure of intrinsic complexity of learning

DOI10.2307/2275636zbMath0895.68121MaRDI QIDQ4382469

Sanjay Jain, Arun 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

zbMATH Keywords

reducibility; intrinsic complexity of learning; language learning machine

Mathematics Subject Classification ID

68T05: Learning and adaptive systems in artificial intelligence

68Q45: Formal languages and automata

03D05: Automata and formal grammars in connection with logical questions

03D20: Recursive functions and relations, subrecursive hierarchies

Related Items

Mind change speed-up for learning languages from positive data, An approach to intrinsic complexity of uniform learning, On the intrinsic complexity of learning recursive functions, Ordinal mind change complexity of language identification, Language learning from texts: Degrees of intrinsic complexity and their characterizations, Induction by enumeration, Intrinsic complexity of learning geometrical concepts from positive data, Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data

Cites Work

• Unnamed Item
• Finding patterns common to a set of strings
• The intrinsic complexity of language identification
• Inductive inference of formal languages from positive data
• Periodicity in generations of automata
• A Machine-Independent Theory of the Complexity of Recursive Functions
• Language identification in the limit