scientific article; zbMATH DE number 3604877
From MaRDI portal
Publication:4170707
zbMath0389.03015MaRDI QIDQ4170707
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Artificial intelligence (68T99) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Computability and recursion theory (03D99)
Related Items (16)
On learning of functions refutably. ⋮ Research in the theory of inductive inference by GDR mathematicians - A survey ⋮ 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 the presence of partial explanations ⋮ Learning in Friedberg numberings ⋮ Consistent and coherent learning with \(\delta \)-delay ⋮ 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 ⋮ Learning languages and functions by erasing ⋮ Learning by the process of elimination ⋮ One-sided error probabilistic inductive inference and reliable frequency identification ⋮ Training sequences
This page was built for publication:
