scientific article; zbMATH DE number 3604877

MaRDI QIDQ4170707zbMATH OpenFDO

Authors Rolf Wiehagen

Publication date 1978

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Computability and recursion theory (03D99) Artificial intelligence (68T99)

Cited in

(16)

• Research in the theory of inductive inference by GDR mathematicians - A survey
• Learning in the presence of partial explanations
• Learning languages and functions by erasing
• Learning by the process of elimination
• On learning of functions refutably.
• Comparison of identification criteria for machine inductive inference
• Control structures in hypothesis spaces: The influence on learning
• On the power of probabilistic strategies in inductive inference
• One-sided error probabilistic inductive inference and reliable frequency identification
• Training sequences
• Learning recursive functions: A survey
• Learning indexed families of recursive languages from positive data: A survey
• When unlearning helps
• Non-U-shaped vacillatory and team learning
• Learning in Friedberg numberings
• Consistent and coherent learning with \(\delta \)-delay

This page was built for publication:

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