Feasible Iteration of Feasible Learning Functionals
From MaRDI portal
Publication:3520048
DOI10.1007/978-3-540-75225-7_7zbMath1142.68385OpenAlexW1595965978MaRDI QIDQ3520048
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
Related Items
Feasible Iteration of Feasible Learning Functionals ⋮ Learning with ordinal-bounded memory from positive data ⋮ Dynamically Delayed Postdictive Completeness and Consistency in Learning ⋮ Resource restricted computability theoretic learning: Illustrative topics and problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polynomial and abstract subrecursive classes
- On the role of procrastination in machine learning
- An average-case optimal one-variable pattern language learner
- Median Selection Requires $(2+\epsilon)n$ Comparisons
- On characterizations of the basic feasible functionals, Part I
- Feasible Iteration of Feasible Learning Functionals
- A new Characterization of Type-2 Feasibility
- Parsimony hierarchies for inductive inference