Asymptotic Density and Computability

dc.contributor.author	Batyrshin I.I.
dc.date.accessioned	2022-02-09T20:35:46Z
dc.date.available	2022-02-09T20:35:46Z
dc.date.issued	2021
dc.identifier.issn	1066-369X
dc.identifier.uri	https://dspace.kpfu.ru/xmlui/handle/net/169284
dc.description.abstract	We prove that a set is bi-immune if and only if its images under computable permutations are not generically computable or effectively densely computable sets. An example of a coarsely computable bi-immune set is constructed. It is also proved that for any set there is a permutation from the same Turing degree such that its image under this permutation is an effectively densely computable set. Upper densities of weakly 1-generic sets are studied.
dc.relation.ispartofseries	Russian Mathematics
dc.subject	asymptotic density
dc.subject	bi-immune set
dc.subject	generic complexity
dc.subject	Turing degrees
dc.subject	weakly 1-generic set
dc.title	Asymptotic Density and Computability
dc.type	Article
dc.relation.ispartofseries-issue	10
dc.relation.ispartofseries-volume	65
dc.collection	Публикации сотрудников КФУ
dc.source.id	SCOPUS1066369X-2021-65-10-SID85119504880

Файлы в этом документе

Размер: 71.90Kb

Формат: PDF

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