Kazan Federal University Digital Repository
WEAK REDUCIBILITY OF COMPUTABLE AND GENERALIZED COMPUTABLE NUMBERINGS
- Home
- →
- Научные публикации в Scopus
- →
- Публикации сотрудников КФУ Scopus
- →
- View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
| dc.contributor.author | Ivanova Z.K. | |
| dc.contributor.author | Faizrahmanov M.K. | |
| dc.date.accessioned | 2022-02-09T20:44:53Z | |
| dc.date.available | 2022-02-09T20:44:53Z | |
| dc.date.issued | 2021 | |
| dc.identifier.uri | https://dspace.kpfu.ru/xmlui/handle/net/170001 | |
| dc.description.abstract | We consider universal and minimal computable numberings with respect to weak reducibility. A family of total functions that have a universal numbering and two non-weakly equivalent computable numberings is constructed. A sufficient condition for the non-existence of minimal A-computable numberings of families with respect to weak reducibility is found for every oracle A. | |
| dc.subject | A-computable numbering | |
| dc.subject | computable numbering | |
| dc.subject | Rogers semilattice | |
| dc.subject | w-reducibility | |
| dc.title | WEAK REDUCIBILITY OF COMPUTABLE AND GENERALIZED COMPUTABLE NUMBERINGS | |
| dc.type | Article | |
| dc.relation.ispartofseries-issue | 1 | |
| dc.relation.ispartofseries-volume | 18 | |
| dc.collection | Публикации сотрудников КФУ | |
| dc.relation.startpage | 112 | |
| dc.source.id | SCOPUS-2021-18-1-SID85108862285 |
Files in this item
This item appears in the following Collection(s)
-
Публикации сотрудников КФУ Scopus [24551]
Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.