Generic Amplification of Recursively Enumerable Sets
- Авторлар: Rybalov A.N.1
-
Мекемелер:
- Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences
- Шығарылым: Том 57, № 4 (2018)
- Беттер: 289-294
- Бөлім: Article
- URL: https://journal-vniispk.ru/0002-5232/article/view/234095
- DOI: https://doi.org/10.1007/s10469-018-9500-y
- ID: 234095
Дәйексөз келтіру
Аннотация
Generic amplification is a method that allows algebraically undecidable problems to generate problems undecidable for almost all inputs. It is proved that every simple negligible set is undecidable for almost all inputs, but it cannot be obtained via amplification from any undecidable set. On the other hand, it is shown that every recursively enumerable set with nonzero asymptotic density can be obtained via amplification from a set of natural numbers.
Авторлар туралы
A. Rybalov
Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences
Хат алмасуға жауапты Автор.
Email: alexander.rybalov@gmail.com
Ресей, ul. Pevtsova 13, Omsk, 644099
Қосымша файлдар
