|
This article is cited in 2 scientific papers (total in 2 papers)
Complexity properties of recursively enumerable sets and $bsQ$-completeness
R. Sh. Omanadze Tbilisi Ivane Javakhishvili State University, Ilia Vekua Institute of Applied Mathematics
Received: 25.05.1999
Citation:
R. Sh. Omanadze, “Complexity properties of recursively enumerable sets and $bsQ$-completeness”, Mat. Zametki, 68:4 (2000), 554–559; Math. Notes, 68:4 (2000), 476–480
Linking options:
https://www.mathnet.ru/eng/mzm975https://doi.org/10.4213/mzm975 https://www.mathnet.ru/eng/mzm/v68/i4/p554
|
|