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://journals.rcsi.science/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
补充文件
