Minimal generalized computable enumerations and high degrees

dc.contributor.author	Faizrahmanov M.
dc.date.accessioned	2018-04-05T07:09:10Z
dc.date.available	2018-04-05T07:09:10Z
dc.date.issued	2017
dc.identifier.issn	0037-4466
dc.identifier.uri	http://dspace.kpfu.ru/xmlui/handle/net/129559
dc.description.abstract	© 2017, Pleiades Publishing, Ltd. We establish that the set of minimal generalized computable enumerations of every infinite family computable with respect to a high oracle is effectively infinite. We find some sufficient condition for enumerations of the infinite families computable with respect to high oracles under which there exist minimal generalized computable enumerations that are irreducible to the enumerations.
dc.relation.ispartofseries	Siberian Mathematical Journal
dc.subject	arithmetic enumeration
dc.subject	generalized computable enumeration
dc.subject	high set
dc.subject	Low set 2
dc.subject	minimal enumeration
dc.title	Minimal generalized computable enumerations and high degrees
dc.type	Article
dc.relation.ispartofseries-issue	3
dc.relation.ispartofseries-volume	58
dc.collection	Публикации сотрудников КФУ
dc.relation.startpage	553
dc.source.id	SCOPUS00374466-2017-58-3-SID85021269219

Files in this item

Size: 72.92Kb

Format: PDF

Публикации сотрудников КФУ Scopus [24551]
Коллекция содержит публикации сотрудников Казанского федерального (до 2010 года Казанского государственного) университета, проиндексированные в БД Scopus, начиная с 1970г.