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)

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

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)

Cites Work

• Title not available (Why is that?)
• Language identification in the limit
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• The Power of Pluralism for Automatic Program Synthesis
• Gödel numberings of partial recursive functions
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (23)

• Title not available (Why is that?)
• Kolmogorov numberings and minimal identification
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Structured Frequency Algorithms
• On the intrinsic complexity of learning recursive functions
• Robust learning is rich
• AN INFINITE CLASS OF FUNCTIONS IDENTIFIABLE USING MINIMAL PROGRAMS IN ALL KOLMOGOROV NUMBERINGS
• Title not available (Why is that?)
• Learning recursive functions from approximations
• Robust learning -- rich and poor
• Learning with belief levels
• Title not available (Why is that?)
• Quantum inductive inference by finite automata
• 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.
• Learning by the process of elimination
• Robust behaviorally correct learning.
• On learning of functions refutably.
• Title not available (Why is that?)

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)