Elementary formal systems, intrinsic complexity, and procrastination
From MaRDI portal
(Redirected from Publication:675045)
Recommendations
Cited in
(19)- On a generalized notion of mistake bounds
- On the learnability of recursively enumerable languages from good examples
- Parsimony hierarchies for inductive inference
- Resource restricted computability theoretic learning: Illustrative topics and problems
- On the intrinsic complexity of learning recursive functions
- On learning unions of pattern languages and tree patterns in the mistake bound model.
- Refuting learning revisited.
- Ordinal mind change complexity of language identification
- Mind Change Complexity of Inferring Unbounded Unions of Pattern Languages from Positive Data
- The logic of reliable and efficient inquiry
- On the classification of recursive languages
- Learning figures with the Hausdorff metric by fractals -- towards computable binary classification
- Mind change complexity of learning logic programs
- scientific article; zbMATH DE number 1416102 (Why is no real title available?)
- Learning elementary formal systems with queries.
- Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data
- Generalized notions of mind change complexity
- General inductive inference types based on linearly-ordered sets
- Unifying logic, topology and learning in parametric logic
This page was built for publication: Elementary formal systems, intrinsic complexity, and procrastination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q675045)
