2011
DOI: 10.1007/978-3-642-24412-4_35
|View full text |Cite
|
Sign up to set email alerts
|

Erratum: Learning without Coding

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. Acknowledgements.We would like to thank Sanjay Jain for noticing our error, and for providing us a proof of the claim's negation.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 2 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?