scientific article; zbMATH DE number 4055080

From MaRDI portal
Publication:3790671





[For the entire collection see Zbl 0624.00018.] The following generalized version of a conjecture made by Ya. M. Barzdin about ten years ago is studied: Let U be a class of recursive functions. If then for every effective operator O mapping U into the recursive functions the image class O(U) of U can be inferred in the sense of a fixed identification criterion, then U is recursively enumerable. It is proved that Barzdin's conjecture is valid for reliable identification as well as for finite inference. The validity for all other identification criteria remains open (e.g. identification in the limit).











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 Q3790671)