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)

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

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)