×

zbMATH — the first resource for mathematics

A few results on the complexity of classes of identifiable recursive function sets. (English) Zbl 0541.03019
Discrete mathematics, Banach Cent. Publ. 7, 135-142 (1982).
[For the entire collection see Zbl 0531.00010.]
The complexity of classes of identifiable recursive function sets (inductive inference) is characterized by analyzing related index sets of recursive functions within the arithmetical hierarchy, and by describing related functionals identifying recursive function sets of a special type of inductive inference within the arithmetical hierarchy of function sets.
MSC:
03D20 Recursive functions and relations, subrecursive hierarchies
03D15 Complexity of computation (including implicit computational complexity)
03D60 Computability and recursion theory on ordinals, admissible sets, etc.
Full Text: EuDML Link