Dynamically Delayed Postdictive Completeness and Consistency in Learning

DOI10.1007/978-3-540-87987-9_32MaRDI QIDQ3529936zbMATH OpenOpenAlexFDO

Authors Timo Kötzing, John Case

Publication date 14 October 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-87987-9_32

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• Difficulties in Forcing Fairness of Polynomial Time Inductive Inference
• Consistent and coherent learning with \(\delta \)-delay
• Feasible Iteration of Feasible Learning Functionals
• On the role of procrastination in machine learning
• Automatic functions, linear time and learning

Cites work

• scientific article; zbMATH DE number 3539202 (Why is no real title available?)
• scientific article; zbMATH DE number 680708 (Why is no real title available?)
• scientific article; zbMATH DE number 1010621 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Consistent and coherent learning with \(\delta \)-delay
• Dynamically Delayed Postdictive Completeness and Consistency in Learning
• Feasible Iteration of Feasible Learning Functionals
• Generalized notions of mind change complexity
• On the role of procrastination in machine learning
• Parsimony hierarchies for inductive inference
• Periodicity in generations of automata
• Robust learning -- rich and poor
• Saving the phenomena: Requirements that inductive inference machines not contradict known data
• Some natural properties of strong-identification in inductive inference
• Toward a mathematical theory of inductive inference

Cited in

(7)

• Feasible Iteration of Feasible Learning Functionals
• Dynamically Delayed Postdictive Completeness and Consistency in Learning
• Resource restricted computability theoretic learning: Illustrative topics and problems
• Consistent and coherent learning with \(\delta \)-delay
• Strongly non-U-shaped language learning results by general techniques
• Difficulties in Forcing Fairness of Polynomial Time Inductive Inference
• Rice and Rice-Shapiro theorems for transfinite correction grammars

This page was built for publication: Dynamically Delayed Postdictive Completeness and Consistency in Learning

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