Reflective inductive inference of recursive functions
From MaRDI portal
Publication:924166
DOI10.1016/J.TCS.2008.02.022zbMATH Open1145.68023OpenAlexW2118038654MaRDI QIDQ924166FDOQ924166
Authors: Gunter Grieser 
Publication date: 28 May 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.02.022
Recommendations
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
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Towards a mathematical theory of machine discovery from facts
- Title not available (Why is that?)
- One-sided error probabilistic inductive inference and reliable frequency identification
- Refuting learning revisited.
- Learning with refutation
- Refutable language learning with a neighbor system.
- On learning of functions refutably.
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (10)
- Reflecting inductive inference machines and its improvement by therapy
- Reflecting and self-confident inductive inference machines
- Title not available (Why is that?)
- On some open problems in reflective inductive inference
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Confident and consistent partial learning of recursive functions
- Learning recursive functions: A survey
- Title not available (Why is that?)
This page was built for publication: Reflective inductive inference of recursive functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q924166)
