scientific article; zbMATH DE number 3859102

zbMATH Open0541.03019MaRDI QIDQ3328529FDOQ3328529

Authors: Reinhard Klette 

Publication date: 1982

Full work available at URL: https://eudml.org/doc/209153

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

Recommendations

• The position of index sets of identifiable sets in the arithmetical hierarchy
• scientific article; zbMATH DE number 2077145
• Inductive inference of recursive functions: complexity bounds
• Characterizing language identification in terms of computable numberings
• A learning-theoretic characterization of classes of recursive functions

zbMATH Keywords

inductive inferencearithmetical hierarchyfunctionalsGödel numberingcomplexity of classes of identifiable recursive function setsindex sets of recursive functions

Mathematics Subject Classification ID

Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Complexity of computation (including implicit computational complexity) (03D15) Recursive functions and relations, subrecursive hierarchies (03D20)

Cited In (3)

• Title not available (Why is that?)
• On a question of nearly minimal identification of functions
• The position of index sets of identifiable sets in the arithmetical hierarchy

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