scientific article; zbMATH DE number 3515457
From MaRDI portal
Publication:4094858
zbMath0329.02016MaRDI QIDQ4094858
Publication date: 1975
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Recursive functions and relations, subrecursive hierarchies (03D20)
Related Items (10)
Characterizing language identification by standardizing operations ⋮ Kolmogorov numberings and minimal identification ⋮ Machine induction without revolutionary paradigm shifts ⋮ Learning with belief levels ⋮ Anomalous learning helps succinctness ⋮ On a question about learning nearly minimal programs ⋮ On the Amount of Nonconstructivity in Learning Recursive Functions ⋮ Comparison of identification criteria for machine inductive inference ⋮ Closedness properties in ex-identification ⋮ Learning languages and functions by erasing
This page was built for publication:
