scientific article; zbMATH DE number 3515457

MaRDI QIDQ4094858zbMATH OpenFDO

Authors Rūsiņš Freivalds

Publication date 1975

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Recursive functions and relations, subrecursive hierarchies (03D20)

Cited in

(11)

• Learning languages and functions by erasing
• Learning with belief levels
• On the amount of nonconstructivity in learning recursive functions
• Secretive interaction. Players and strategies
• On a question about learning nearly minimal programs
• Closedness properties in ex-identification
• Machine induction without revolutionary paradigm shifts
• Anomalous learning helps succinctness
• Characterizing language identification by standardizing operations
• Comparison of identification criteria for machine inductive inference
• Kolmogorov numberings and minimal identification

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