Generic Amplification of Recursively Enumerable Sets
- Autores: Rybalov A.N.1
-
Afiliações:
- Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences
- Edição: Volume 57, Nº 4 (2018)
- Páginas: 289-294
- Seção: Article
- URL: https://journals.rcsi.science/0002-5232/article/view/234095
- DOI: https://doi.org/10.1007/s10469-018-9500-y
- ID: 234095
Citar
Resumo
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.
Sobre autores
A. Rybalov
Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences
Autor responsável pela correspondência
Email: alexander.rybalov@gmail.com
Rússia, ul. Pevtsova 13, Omsk, 644099
Arquivos suplementares
