The complexity of learning SUBSEQ(A)

DOI10.2178/jsl/1245158093zbMath1180.03041OpenAlexW2086713454MaRDI QIDQ3399186

Brian Postow, Stephen A. Fenner, William I. Gasarch

Publication date: 29 September 2009

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.135.2114

zbMATH Keywords

complexityformal languagesinductive inferencemachine learning

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45) Applications of computability and recursion theory (03D80)

This page was built for publication: The complexity of learning SUBSEQ(A)