Computable families of finite-valued computable functions
The Bulletin of Irkutsk State University. Series Mathematics, Tome 3 (2010) no. 4, pp. 58-64
Cet article a éte moissonné depuis la source Math-Net.Ru
We prove that the index sets of all computable families of computable functions are presentable by the index sets of computable families of finite-valued computable functions.
Keywords:
index set; computable function.
@article{IIGUM_2010_3_4_a6,
author = {Yu. D. Korolkov},
title = {Computable families of finite-valued computable functions},
journal = {The Bulletin of Irkutsk State University. Series Mathematics},
pages = {58--64},
year = {2010},
volume = {3},
number = {4},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/IIGUM_2010_3_4_a6/}
}
Yu. D. Korolkov. Computable families of finite-valued computable functions. The Bulletin of Irkutsk State University. Series Mathematics, Tome 3 (2010) no. 4, pp. 58-64. http://geodesic.mathdoc.fr/item/IIGUM_2010_3_4_a6/
[1] Yu. L. Ershov, Teoriya numeratsii, Nauka, M., 1977 | MR
[2] Yu. D. Korolkov, “Otsenka slozhnosti indeksnykh mnozhestv semeistv obscherekursivnykh funktsii v arifmeticheskoi ierarkhii”, Algebra i logika, 41:2 (2002), 155–165 | MR | Zbl
[3] V. L. Selivanov, “Tonkie ierarkhii arifmeticheskikh mnozhestv i opredelimye indeksnye mnozhestva”, Matematicheskaya logika i algoritmicheskie voprosy, 12 (1989), 165–185 | MR | Zbl
[4] Yu. L. Ershov, Theory of numberings, Preprint 18, Novosibirsk, 1996 | MR