Difficulties in Forcing Fairness of Polynomial Time Inductive Inference

DOI10.1007/978-3-642-04414-4_23zbMath1262.68063OpenAlexW2112564936MaRDI QIDQ3648757

Timo Kötzing, John Case

Publication date: 1 December 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-04414-4_23

Mathematics Subject Classification ID

Computational learning theory (68Q32) Formal languages and automata (68Q45)

Related Items (8)

Revisiting Shinohara's algorithm for computing descriptive patterns ⋮ Automatic learning from positive data and negative counterexamples ⋮ Learning in the limit with lattice-structured hypothesis spaces ⋮ Learnability and positive equivalence relations ⋮ Learners based on transducers ⋮ Partial learning of recursively enumerable languages ⋮ Topological separations in inductive inference ⋮ On the role of update constraints and text-types in iterative learning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Learning efficiency of very simple grammars from positive data
• Saving the phenomena: Requirements that inductive inference machines not contradict known data
• Program Size Complexity of Correction Grammars in the Ershov Hierarchy
• Dynamically Delayed Postdictive Completeness and Consistency in Learning
• Dynamic Modeling in Inductive Inference
• Learning correction grammars
• Inductive inference of formal languages from positive data
• Toward a mathematical theory of inductive inference
• Language identification in the limit

This page was built for publication: Difficulties in Forcing Fairness of Polynomial Time Inductive Inference