Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Learnability of co-r.e. classes

From MaRDI portal
Publication:2890197
Jump to:navigation, search

DOI10.1007/978-3-642-28332-1_22zbMATH Open1351.68123OpenAlexW156696518MaRDI QIDQ2890197FDOQ2890197


Authors: Ziyuan Gao, Frank Stephan Edit this on Wikidata


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




Recommendations

  • scientific article; zbMATH DE number 2077152
  • 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


Mathematics Subject Classification ID

Computational learning theory (68Q32)



Cited In (5)

  • Co-learning of recursive languages from positive data
  • Prescribed learning of r.e. classes
  • Prescribed Learning of R.E. Classes
  • On the help of bounded shot verifiers, comparators and standardisers for learnability in inductive inference
  • Title not available (Why is that?)





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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2890197&oldid=15846380"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 19:33. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki