Feasible Iteration of Feasible Learning Functionals

DOI10.1007/978-3-540-75225-7_7MaRDI QIDQ3520048zbMATH OpenOpenAlexFDO

Authors Timo Kötzing, Todd Paddock, John Case

Publication date 19 August 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-75225-7_7

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• ON LEARNING LIMITING PROGRAMS
• Learning and computing in the limit
• Parsimony hierarchies for inductive inference
• Dynamically Delayed Postdictive Completeness and Consistency in Learning
• Some applications of logic to feasibility in higher types

Cites work

• A new Characterization of Type-2 Feasibility
• An average-case optimal one-variable pattern language learner
• Feasible Iteration of Feasible Learning Functionals
• scientific article; zbMATH DE number 680708 (Why is no real title available?)
• scientific article; zbMATH DE number 1161563 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Median selection requires (2+)n comparisons
• On characterizations of the basic feasible functionals. I
• On the role of procrastination in machine learning
• Parsimony hierarchies for inductive inference
• Polynomial and abstract subrecursive classes

Cited in

(4)

• Feasible Iteration of Feasible Learning Functionals
• Dynamically Delayed Postdictive Completeness and Consistency in Learning
• Learning with ordinal-bounded memory from positive data
• Resource restricted computability theoretic learning: Illustrative topics and problems

This page was built for publication: Feasible Iteration of Feasible Learning Functionals

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