Inductive inference with bounded mind changes

DOI10.1007/3-540-57369-0_33MaRDI QIDQ4267809zbMATH OpenFDO

Authors Yasuhito Mukouchi

Publication date 24 October 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2324/3161

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• INDUCTIVE INFERENCE OF LIMITING PROGRAMS WITH BOUNDED NUMBER OF MIND CHANGES
• Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
• Mind Change Complexity of Inferring Unbounded Unions of Pattern Languages from Positive Data
• scientific article; zbMATH DE number 512873

Cited in

(10)

• Necessary and sufficient conditions for learning with correction queries
• Probabilistic language learning under monotonicity constraints
• Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
• Mind change efficient learning
• Mind Change Complexity of Inferring Unbounded Unions of Pattern Languages from Positive Data
• scientific article; zbMATH DE number 67620 (Why is no real title available?)
• LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES
• scientific article; zbMATH DE number 1960352 (Why is no real title available?)
• INDUCTIVE INFERENCE OF LIMITING PROGRAMS WITH BOUNDED NUMBER OF MIND CHANGES
• Machine induction without revolutionary paradigm shifts

This page was built for publication: Inductive inference with bounded mind changes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4267809)