Reflecting and self-confident inductive inference machines
From MaRDI portal
Publication:6061900
DOI10.1007/3-540-60454-5_46zbMATH Open1527.68183MaRDI QIDQ6061900FDOQ6061900
Authors: Klaus P. Jantke
Publication date: 8 December 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Recommendations
Learning and adaptive systems in artificial intelligence (68T05) Computational learning theory (68Q32)
Cites Work
- Some natural properties of strong-identification in inductive inference
- Title not available (Why is that?)
- Toward a mathematical theory of inductive inference
- Title not available (Why is that?)
- Language identification in the limit
- Monotonic and non-monotonic inductive inference
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Title not available (Why is that?)
- Periodicity in generations of automata
- Title not available (Why is that?)
- Infinitary self-reference in learning theory
- Title not available (Why is that?)
- Research in the theory of inductive inference by GDR mathematicians - A survey
- Title not available (Why is that?)
- Title not available (Why is that?)
- Case-based representation and learning of pattern languages
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: Reflecting and self-confident inductive inference machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6061900)