Evaluating the Complexity of Index Sets for Families of General Recursive Functions in the Arithmetic Hierarchy
Algebra i logika, Tome 41 (2002) no. 2, pp. 155-165
Voir la notice de l'article provenant de la source Math-Net.Ru
The complexity of index sets of families of general recursive functions is evaluated in the Kleene – Mostowski arithmetic hierarchy.
Keywords:
general recursive function, computable family of general recursive functions, discrete family of general recursive functions, effectively discrete family of general recursive functions.
@article{AL_2002_41_2_a3,
author = {Yu. D. Korolkov},
title = {Evaluating the {Complexity} of {Index} {Sets} for {Families} of {General} {Recursive} {Functions} in the {Arithmetic} {Hierarchy}},
journal = {Algebra i logika},
pages = {155--165},
publisher = {mathdoc},
volume = {41},
number = {2},
year = {2002},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/AL_2002_41_2_a3/}
}
TY - JOUR AU - Yu. D. Korolkov TI - Evaluating the Complexity of Index Sets for Families of General Recursive Functions in the Arithmetic Hierarchy JO - Algebra i logika PY - 2002 SP - 155 EP - 165 VL - 41 IS - 2 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/AL_2002_41_2_a3/ LA - ru ID - AL_2002_41_2_a3 ER -
Yu. D. Korolkov. Evaluating the Complexity of Index Sets for Families of General Recursive Functions in the Arithmetic Hierarchy. Algebra i logika, Tome 41 (2002) no. 2, pp. 155-165. http://geodesic.mathdoc.fr/item/AL_2002_41_2_a3/