Inductive inference of recursive functions: Complexity bounds
From MaRDI portal
Publication:4560353
DOI10.1007/BFb0019358zbMath1415.03046MaRDI QIDQ4560353
Rūsiņš Freivalds, Ja. M. Barzdin', Karlis Podnieks
Publication date: 11 December 2018
Published in: Baltic Computer Science (Search for Journal in Brave)
68Q32: Computational learning theory
03D20: Recursive functions and relations, subrecursive hierarchies
03D45: Theory of numerations, effectively presented structures
Related Items
Mind change speed-up for learning languages from positive data, Learning all subfunctions of a function, Learning recursive functions: A survey, Learning with belief levels, On the intrinsic complexity of learning recursive functions, On learning of functions refutably., Robust learning -- rich and poor, Amount of nonconstructivity in deterministic finite automata