Inductive inference of recursive functions: qualitative theory

DOI10.1007/BFB0019357MaRDI QIDQ4560352zbMATH OpenFDO

Authors Rūsiņš Freivalds

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/BFB0019357

zbMATH Keywords

identification typeinductive inferencerecursive functiontotal functionTuring machine

Mathematics Subject Classification ID

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

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

• Gödel numberings of partial recursive functions
• 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?)
• 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

(26)

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

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)