Towards a mathematical theory of machine discovery from facts

DOI10.1016/0304-3975(95)91135-DzbMATH Open0873.68187OpenAlexW2071941848MaRDI QIDQ674404FDOQ674404

Authors: Yasuhito Mukouchi, S. Arikawa 

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(95)91135-d

Recommendations

• scientific article; zbMATH DE number 1351096
• scientific article; zbMATH DE number 2077177
• A universal inductive inference machine
• scientific article; zbMATH DE number 791077

Mathematics Subject Classification ID

Cites Work

• Some natural properties of strong-identification in inductive inference
• Queries and concept learning
• Inductive inference of formal languages from positive data
• Toward a mathematical theory of inductive inference
• Title not available (Why is that?)
• Title not available (Why is that?)
• Language identification in the limit
• Title not available (Why is that?)
• A theory of the learnable
• Learning elementary formal systems
• Short note: procedural semantics and negative information of elementary formal system
• Monadic Elementary Formal Systems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Comparison of identification criteria for machine inductive inference
• LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES
• Title not available (Why is that?)
• Alternation and the computational complexity of logic programs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• ELEMENTARY FORMAL SYSTEMS AND FORMAL LANGUAGES-SIMPLE FORMAL SYSTEMS
• A machine discovery from amino acid sequences by decision trees over regular patterns

Cited In (17)

• Title not available (Why is that?)
• Trees and learning
• Learning of erasing primitive formal systems from positive examples
• Theory discovery from data with mixed quantifiers
• Polynomial-time identification of very simple grammars from positive data.
• Title not available (Why is that?)
• Refuting learning revisited.
• Title not available (Why is that?)
• Reflective inductive inference of recursive functions
• A machine-discovery approach to the evaluation of hashing techniques
• Analogical logic program synthesis algorithm that can refute inappropriate similarities
• Learning figures with the Hausdorff metric by fractals -- towards computable binary classification
• Learning with refutation
• Learning elementary formal systems with queries.
• Quantum inductive inference by finite automata
• On learning of functions refutably.
• Refutable language learning with a neighbor system.

This page was built for publication: Towards a mathematical theory of machine discovery from facts

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