Dynamically Delayed Postdictive Completeness and Consistency in Learning

DOI10.1007/978-3-540-87987-9_32zbMath1157.68034OpenAlexW1508059006MaRDI QIDQ3529936

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)

Related Items (5)

Strongly non-U-shaped language learning results by general techniques ⋮ Dynamically Delayed Postdictive Completeness and Consistency in Learning ⋮ Resource restricted computability theoretic learning: Illustrative topics and problems ⋮ Rice and Rice-Shapiro Theorems for transfinite correction grammars ⋮ Difficulties in Forcing Fairness of Polynomial Time Inductive Inference

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Consistent and coherent learning with \(\delta \)-delay
• Saving the phenomena: Requirements that inductive inference machines not contradict known data
• Some natural properties of strong-identification in inductive inference
• On the role of procrastination in machine learning
• Robust learning -- rich and poor
• Generalized notions of mind change complexity
• Feasible Iteration of Feasible Learning Functionals
• Dynamically Delayed Postdictive Completeness and Consistency in Learning
• Periodicity in generations of automata
• Toward a mathematical theory of inductive inference
• Parsimony hierarchies for inductive inference

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