Elementary formal systems, intrinsic complexity, and procrastination

DOI10.1006/inco.1996.2614zbMath0872.68157OpenAlexW1986174280MaRDI QIDQ675045

Sanjay Jain, Arun Sharma

Publication date: 6 March 1997

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1996.2614

zbMATH Keywords

logic programmingelementary formal systems

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (16)

Learning elementary formal systems with queries. ⋮ Refuting learning revisited. ⋮ Generalized notions of mind change complexity ⋮ Parsimony hierarchies for inductive inference ⋮ On the classification of recursive languages ⋮ On the intrinsic complexity of learning recursive functions ⋮ Learning figures with the Hausdorff metric by fractals -- towards computable binary classification ⋮ On the learnability of recursively enumerable languages from good examples ⋮ Mind change complexity of inferring unbounded unions of restricted pattern languages from positive data ⋮ Resource restricted computability theoretic learning: Illustrative topics and problems ⋮ Ordinal mind change complexity of language identification ⋮ The logic of reliable and efficient inquiry ⋮ On learning unions of pattern languages and tree patterns in the mistake bound model. ⋮ On a generalized notion of mistake bounds ⋮ Mind change complexity of learning logic programs ⋮ Unifying logic, topology and learning in parametric logic

This page was built for publication: Elementary formal systems, intrinsic complexity, and procrastination