Abstract
Gold [Gol67] discovered the enumeration technique, a simple but powerful class of algorithms for learning in the limit (inductive inference). We introduce a provably more powerful technique, which enables us to refute a conjecture of Barzdins [Zeu87] characterizing the class of functions inferrible by the enumeration technique.
Cite
CITATION STYLE
APA
Kurtz, S. A., & Smith, C. H. (1989). A refutation of Barzdins’ conjecture. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 397 LNAI, pp. 171–176). Springer Verlag. https://doi.org/10.1007/3-540-51734-0_59
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free