|
This article is cited in 1 scientific paper (total in 1 paper)
Evaluating the Complexity of Index Sets for Families of General Recursive Functions in the Arithmetic Hierarchy
Yu. D. Korolkov
Abstract:
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.
Received: 30.05.1999
Citation:
Yu. D. Korolkov, “Evaluating the Complexity of Index Sets for Families of General Recursive Functions in the Arithmetic Hierarchy”, Algebra Logika, 41:2 (2002), 155–165; Algebra and Logic, 41:2 (2002), 87–92
Linking options:
https://www.mathnet.ru/eng/al178 https://www.mathnet.ru/eng/al/v41/i2/p155
|
Statistics & downloads: |
Abstract page: | 290 | Full-text PDF : | 85 | References: | 50 | First page: | 1 |
|