scientific article
From MaRDI portal
Publication:3329450
zbMath0542.03020MaRDI QIDQ3329450
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computable operatorsfastest programidentifiability of recursive functionsinductive inference of recursive functions
Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20)
Related Items
On learning of functions refutably. ⋮ On the power of recursive optimizers ⋮ Reflecting and self-confident inductive inference machines ⋮ Learning recursive functions: A survey ⋮ Unnamed Item ⋮ Learning classes of approximations to non-recursive functions. ⋮ One-sided error probabilistic inductive inference and reliable frequency identification ⋮ On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings
This page was built for publication:
