Inductive inference of recursive functions: Complexity bounds

DOI10.1007/BFb0019358zbMath1415.03046OpenAlexW1590972739MaRDI QIDQ4560353

Karlis Podnieks, Rūsiņš Freivalds, Ja. M. Barzdin'

Publication date: 11 December 2018

Published in: Baltic Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0019358

zbMATH Keywords

finite automatonTuring machineinductive inferencerecursive functionprediction strategy

Mathematics Subject Classification ID

Computational learning theory (68Q32) Recursive functions and relations, subrecursive hierarchies (03D20) Theory of numerations, effectively presented structures (03D45)

Related Items

On learning of functions refutably. ⋮ Robust learning -- rich and poor ⋮ Learning all subfunctions of a function ⋮ Mind change speed-up for learning languages from positive data ⋮ On the intrinsic complexity of learning recursive functions ⋮ Amount of nonconstructivity in deterministic finite automata ⋮ Learning recursive functions: A survey ⋮ Learning with belief levels

Cites Work

• On the inference of Turing machines from sample computations
• Language identification in the limit
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item