Refuting learning revisited.

DOI10.1016/S0304-3975(02)00422-XMaRDI QIDQ1874232zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 2080665
• scientific article; zbMATH DE number 1301797
• scientific article; zbMATH DE number 1436988
• Learning with refutation
• scientific article; zbMATH DE number 2077179

Cites work

• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 1233702 (Why is no real title available?)
• scientific article; zbMATH DE number 1351096 (Why is no real title available?)
• scientific article; zbMATH DE number 512866 (Why is no real title available?)
• scientific article; zbMATH DE number 612169 (Why is no real title available?)
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 2077177 (Why is no real title available?)
• scientific article; zbMATH DE number 3237829 (Why is no real title available?)
• Classical recursion theory. The theory of functions and sets of natural numbers
• Classifying regular events in symbolic logic
• Decidability and essential undecidability
• Elementary formal systems, intrinsic complexity, and procrastination
• Inductive inference and unsolvability
• Inductive inference from theory laden data
• Inductive inference of monotonic formal systems from positive data
• Language identification in the limit
• Learning power and language expressiveness.
• Learning via queries
• Learning via queries in [+, <]
• Learning with refutation
• Logical number theory I. An introduction
• On learning of functions refutably.
• Reflecting inductive inference machines and its improvement by therapy
• Scientific discovery based on belief revision
• Some natural properties of strong-identification in inductive inference
• Towards a mathematical theory of machine discovery from facts

Cited in

(11)

• scientific article; zbMATH DE number 2077179 (Why is no real title available?)
• Reflective inductive inference of recursive functions
• On learning of functions refutably.
• Refutable language learning with a neighbor system.
• Passive learning: a critique by example
• Learning figures with the Hausdorff metric by fractals -- towards computable binary classification
• scientific article; zbMATH DE number 2080665 (Why is no real title available?)
• Learning with refutation
• On the learnability of vector spaces
• scientific article; zbMATH DE number 2080664 (Why is no real title available?)
• Trees and learning

This page was built for publication: Refuting learning revisited.

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