ML Anthology

Erratum: Learning Without Coding

Samuel E. Moelius, Sandra Zilles
ALT 2011 pp. 452
doi:10.1007/978-3-642-24412-4_35 /alt/2011/moelius2011alt-erratum/

Abstract

Our ALT’2010 paper claimed that every computably finitely thick [LZ96, Definition 9] class of languages can be identified by enumeration operator [MZ10, Definition 1(e) and Theorem 12]. However, this is, in fact, false . We intend to include a proof of the claim’s negation in the journal version of our paper, which has been submitted.

PDF ALT Semantic Scholar

Cite

Text

Moelius and Zilles. "Erratum: Learning Without Coding." International Conference on Algorithmic Learning Theory, 2011. doi:10.1007/978-3-642-24412-4_35

Markdown

[Moelius and Zilles. "Erratum: Learning Without Coding." International Conference on Algorithmic Learning Theory, 2011.](https://mlanthology.org/alt/2011/moelius2011alt-erratum/) doi:10.1007/978-3-642-24412-4_35

BibTeX

@inproceedings{moelius2011alt-erratum,
  title     = {{Erratum: Learning Without Coding}},
  author    = {Moelius, Samuel E. and Zilles, Sandra},
  booktitle = {International Conference on Algorithmic Learning Theory},
  year      = {2011},
  pages     = {452},
  doi       = {10.1007/978-3-642-24412-4_35},
  url       = {https://mlanthology.org/alt/2011/moelius2011alt-erratum/}
}