Erratum: Learning without Coding

Download PDF
Open Webpage

Samuel E. Moelius, Sandra Zilles

Published: 2011, Last Modified: 15 May 2025ALT 2011EveryoneRevisionsBibTeXCC BY-SA 4.0
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.