Learning Theory and Descriptive Set Theory

DOI10.1093/LOGCOM/3.1.27MaRDI QIDQ4272503zbMATH OpenOpenAlexFDO

Authors Kevin T. Kelly

Publication date 6 December 1993

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/80f91c318ecdb7d139344bd1ff8ab6bd02a76abb

zbMATH Keywords

\(n\)-trial predicatesarithmetical complexityBorel complexitycomputable scientistsformal learning theoryhypothesis assessmentideal scientistsinductive inferencelanguage learnabilityrecursive function identification

Mathematics Subject Classification ID

Applications of computability and recursion theory (03D80) Descriptive set theory (03E15) Learning and adaptive systems in artificial intelligence (68T05) Memory and learning in psychology (91E40)

Recommendations

• Learning sets and topologies
• Learnability can be independent of set theory (invited paper)
• Learning theory in the arithmetic hierarchy
• Generalized descriptive set theory and classification theory
• Descriptive set theory
• Probably Approximate Learning of Sets and Functions
• scientific article; zbMATH DE number 1966621
• Towards the Effective Descriptive Set Theory
• On the mathematical foundations of learning
• On the learnability of infinitary regular sets

Cited in

(7)

• Learnability: Admissible, co-finite, and hypersimple languages
• Learning theory in the arithmetic hierarchy
• Learning theory and epistemology
• Learnability: admissible, co-finite, and hypersimple languages
• Learning and computing in the limit
• A framework for a theory of automated learning
• Note on a central lemma for learning theory

This page was built for publication: Learning Theory and Descriptive Set Theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4272503)