Inductive inference of recursive functions: qualitative theory

DOI10.1007/BFB0019357zbMATH Open1415.03045MaRDI QIDQ4560352FDOQ4560352

Authors Rūsiņš Freivalds

Publication date 11 December 2018

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

zbMATH Keywords

inductive inferenceTuring machinerecursive functiontotal functionidentification type

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 517033
• Inductive inference of recursive functions: complexity bounds
• scientific article; zbMATH DE number 2077151
• Topological aspects of numberings
• scientific article; zbMATH DE number 3950511

Cites work

• scientific article; zbMATH DE number 3900734 (Why is no real title available?)
• scientific article; zbMATH DE number 3518782 (Why is no real title available?)
• scientific article; zbMATH DE number 3584924 (Why is no real title available?)
• scientific article; zbMATH DE number 3585414 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3404166 (Why is no real title available?)
• Gödel numberings of partial recursive functions
• Language identification in the limit
• The Power of Pluralism for Automatic Program Synthesis
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication

Cited in

(24)

• Quantum inductive inference by finite automata
• scientific article; zbMATH DE number 1966617 (Why is no real title available?)
• Learning languages and functions by erasing
• On the intrinsic complexity of learning recursive functions
• Learning classes of approximations to non-recursive functions.
• Learning by the process of elimination
• Robust behaviorally correct learning.
• AN INFINITE CLASS OF FUNCTIONS IDENTIFIABLE USING MINIMAL PROGRAMS IN ALL KOLMOGOROV NUMBERINGS
• Learning with belief levels
• scientific article; zbMATH DE number 4119662 (Why is no real title available?)
• scientific article; zbMATH DE number 1395882 (Why is no real title available?)
• On learning of functions refutably.
• Language learning from texts: Degrees of intrinsic complexity and their characterizations
• Robust learning is rich
• Structured Frequency Algorithms
• scientific article; zbMATH DE number 2077145 (Why is no real title available?)
• scientific article; zbMATH DE number 2077151 (Why is no real title available?)
• scientific article; zbMATH DE number 3950511 (Why is no real title available?)
• scientific article; zbMATH DE number 517033 (Why is no real title available?)
• Robust learning -- rich and poor
• Learning recursive functions from approximations
• Inductive inference of recursive functions: complexity bounds
• Kolmogorov numberings and minimal identification
• scientific article; zbMATH DE number 841093 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4560352)