scientific article; zbMATH DE number 2077145

zbMATH Open1044.03528MaRDI QIDQ4470530FDOQ4470530

Authors: J. Smotrovs, Andris Ambainis 

Publication date: 1 July 2004

Title of this publication is not available (Why is that?)

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
• scientific article; zbMATH DE number 1966617
• 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

Mathematics Subject Classification ID

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

Cited In (5)

• Title not available (Why is that?)
• Inductive inference of recursive functions: complexity bounds
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication:

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