Towards a mathematical theory of machine discovery from facts
From MaRDI portal
Publication:674404
DOI10.1016/0304-3975(95)91135-DzbMath0873.68187OpenAlexW2071941848MaRDI QIDQ674404
Yasuhito Mukouchi, Setsuo 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
Related Items
Learning elementary formal systems with queries. ⋮ Refutable language learning with a neighbor system. ⋮ On learning of functions refutably. ⋮ Refuting learning revisited. ⋮ Polynomial-time identification of very simple grammars from positive data. ⋮ Trees and learning ⋮ Learning of erasing primitive formal systems from positive examples ⋮ Analogical logic program synthesis algorithm that can refute inappropriate similarities ⋮ Learning figures with the Hausdorff metric by fractals -- towards computable binary classification ⋮ Reflective inductive inference of recursive functions ⋮ Quantum inductive inference by finite automata ⋮ Learning with refutation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Comparison of identification criteria for machine inductive inference
- A machine discovery from amino acid sequences by decision trees over regular patterns
- Learning elementary formal systems
- Some natural properties of strong-identification in inductive inference
- Queries and concept learning
- Alternation and the computational complexity of logic programs
- A theory of the learnable
- Inductive inference of formal languages from positive data
- Short note: procedural semantics and negative information of elementary formal system
- Toward a mathematical theory of inductive inference
- LEARNING RECURSIVE LANGUAGES WITH BOUNDED MIND CHANGES
- ELEMENTARY FORMAL SYSTEMS AND FORMAL LANGUAGES-SIMPLE FORMAL SYSTEMS
- Monadic Elementary Formal Systems
- Language identification in the limit
