Refuting learning revisited.

DOI10.1016/S0304-3975(02)00422-XzbMath1038.68100OpenAlexW2123725173MaRDI QIDQ1874232

Wolfgang Merkle, Frank Stephan

Publication date: 22 May 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00422-x

zbMATH Keywords

Inductive inferenceRecursion theoryFirst-order logicAxiomatizable classesRefuting learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items

Trees and learning ⋮ On the learnability of vector spaces ⋮ Learning figures with the Hausdorff metric by fractals -- towards computable binary classification ⋮ Reflective inductive inference of recursive functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Towards a mathematical theory of machine discovery from facts
• Elementary formal systems, intrinsic complexity, and procrastination
• Inductive inference of monotonic formal systems from positive data
• Classifying regular events in symbolic logic
• Classical recursion theory. The theory of functions and sets of natural numbers
• Logical number theory I. An introduction
• Inductive inference from theory laden data
• Some natural properties of strong-identification in inductive inference
• Learning with refutation
• On learning of functions refutably.
• Learning power and language expressiveness.
• Decidability and essential undecidability
• Reflecting inductive inference machines and its improvement by therapy
• Inductive inference and unsolvability
• Learning via queries in [+, <]
• Learning via queries
• Scientific discovery based on belief revision
• Language identification in the limit

This page was built for publication: Refuting learning revisited.