Inductive inference of recursive functions: Qualitative theory

DOI10.1007/BFB0019357zbMath1415.03045MaRDI QIDQ4560352

Rūsiņš Freivalds

Publication date: 11 December 2018

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

zbMATH Keywords

Turing machineinductive inferencerecursive functiontotal functionidentification type

Mathematics Subject Classification ID

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

Related Items (14)

On learning of functions refutably. ⋮ Robust learning -- rich and poor ⋮ Learning recursive functions from approximations ⋮ Kolmogorov numberings and minimal identification ⋮ Structured Frequency Algorithms ⋮ On the intrinsic complexity of learning recursive functions ⋮ Quantum inductive inference by finite automata ⋮ Learning with belief levels ⋮ Robust learning is rich ⋮ Learning languages and functions by erasing ⋮ Learning classes of approximations to non-recursive functions. ⋮ Robust behaviorally correct learning. ⋮ Learning by the process of elimination ⋮ Language learning from texts: Degrees of intrinsic complexity and their characterizations

Cites Work

• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Gödel numberings of partial recursive functions
• The Power of Pluralism for Automatic Program Synthesis
• Language identification in the limit
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Inductive inference of recursive functions: Qualitative theory