On a question of nearly minimal identification of functions

DOI10.1016/S0020-0190(99)00051-4zbMATH Open1339.68132MaRDI QIDQ294675FDOQ294675

Authors: Sanjay Jain 

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019099000514?np=y

Recommendations

• scientific article; zbMATH DE number 1301785
• scientific article; zbMATH DE number 1453045
• scientific article; zbMATH DE number 4055080
• scientific article; zbMATH DE number 3859102
• AN INFINITE CLASS OF FUNCTIONS IDENTIFIABLE USING MINIMAL PROGRAMS IN ALL KOLMOGOROV NUMBERINGS

zbMATH Keywords

theory of computation

Mathematics Subject Classification ID

Computational learning theory (68Q32) Recursive functions and relations, subrecursive hierarchies (03D20)

Cited In (1)

• On univariate function identification problems

This page was built for publication: On a question of nearly minimal identification of functions

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