Inductive inference of approximations for recursive concepts
From MaRDI portal
Recommendations
Cites work
- A Machine-Independent Theory of the Complexity of Recursive Functions
- Comparison of identification criteria for machine inductive inference
- Finding patterns common to a set of strings
- scientific article; zbMATH DE number 3932417 (Why is no real title available?)
- scientific article; zbMATH DE number 1404232 (Why is no real title available?)
- Ignoring data may be the only way to learn efficiently
- Inductive inference of approximations
- Inductive inference of formal languages from positive data
- Language identification in the limit
- On the error correcting power of pluralism in BC-type inductive inference
- One-sided error probabilistic inductive inference and reliable frequency identification
- Polynomial-time inference of arbitrary pattern languages
- Prudence and other conditions on formal language learning
- Set-driven and rearrangement-independent learning of recursive languages
- The synthesis of language learners.
- Toward a mathematical theory of inductive inference
Cited in
(7)- Approximation methods in inductive inference
- scientific article; zbMATH DE number 4058896 (Why is no real title available?)
- Concept recognition: An approximate reasoning framework
- scientific article; zbMATH DE number 1351087 (Why is no real title available?)
- scientific article; zbMATH DE number 2080443 (Why is no real title available?)
- scientific article; zbMATH DE number 762059 (Why is no real title available?)
- Anomalous learning helps succinctness
This page was built for publication: Inductive inference of approximations for recursive concepts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581360)