Learnability of co-r.e. classes

DOI10.1007/978-3-642-28332-1_22MaRDI QIDQ2890197zbMATH OpenOpenAlexFDO

Authors Ziyuan Gao, Frank Stephan

Publication date 8 June 2012

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-28332-1_22

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• Co-learnability and FIN-identifiability of enumerable classes of total recursive functions
• On the learnability of recursively enumerable languages from good examples
• On conservative learning of recursively enumerable languages
• A learning-theoretic characterization of classes of recursive functions
• Prescribed learning of r.e. classes

Cited in

(6)

• Prescribed learning of r.e. classes
• Learning languages with decidable hypotheses
• Prescribed Learning of R.E. Classes
• Co-learnability and FIN-identifiability of enumerable classes of total recursive functions
• On the help of bounded shot verifiers, comparators and standardisers for learnability in inductive inference
• Co-learning of recursive languages from positive data

This page was built for publication: Learnability of co-r.e. classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2890197)