Enumerable classes of total recursive functions: Complexity of inductive inference

DOI10.1007/3-540-58520-6_50MaRDI QIDQ4470530zbMATH OpenFDO

Authors J. Smotrovs, Andris Ambainis

Publication date 1 July 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58520-6_50

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20) Computational learning theory (68Q32)

Recommendations

• Inductive inference of recursive functions: complexity bounds
• On the interplay between inductive inference of recursive functions, complexity theory and recursive numberings
• Inductive inference of recursive functions: qualitative theory
• Recursion theoretic characterizations of complexity classes of counting functions
• Computer Science Logic
• Reflective inductive inference of recursive functions
• Reflective inductive inference of recursive functions
• Universal computable enumerations of finite classes of families of total functions
• On the inductive inference of recursive real-valued functions
• scientific article; zbMATH DE number 1889701

Cited in

(6)

• scientific article; zbMATH DE number 3859102 (Why is no real title available?)
• Effects of Kolmogorov complexity present in inductive inference as well
• scientific article; zbMATH DE number 1960352 (Why is no real title available?)
• Co-learnability and FIN-identifiability of enumerable classes of total recursive functions
• Inductive inference of recursive functions: complexity bounds
• scientific article; zbMATH DE number 841093 (Why is no real title available?)

This page was built for publication: Enumerable classes of total recursive functions: Complexity of inductive inference

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