Показать сокращенную информацию
dc.contributor.author | Faizrakhmanov M. | |
dc.date.accessioned | 2018-09-19T20:54:31Z | |
dc.date.available | 2018-09-19T20:54:31Z | |
dc.date.issued | 2016 | |
dc.identifier.issn | 1066-369X | |
dc.identifier.uri | https://dspace.kpfu.ru/xmlui/handle/net/143405 | |
dc.description.abstract | © 2016, Allerton Press, Inc.In the paper we introduce the notion of a computable enumeration of a class of families. We prove a criteria for the existence of universal computable enumerations of finite classes of computable families of total functions. In particular, we show that there is a finite computable class of families of total functions without universal computable enumerations. | |
dc.relation.ispartofseries | Russian Mathematics | |
dc.subject | arithmetical enumeration | |
dc.subject | class of families | |
dc.subject | computable enumeration | |
dc.subject | universal enumeration | |
dc.title | Universal computable enumerations of finite classes of families of total functions | |
dc.type | Article | |
dc.relation.ispartofseries-issue | 12 | |
dc.relation.ispartofseries-volume | 60 | |
dc.collection | Публикации сотрудников КФУ | |
dc.relation.startpage | 79 | |
dc.source.id | SCOPUS1066369X-2016-60-12-SID84997496769 |