Generic Amplification of Recursively Enumerable Sets


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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

补充文件

附件文件
动作
1. JATS XML

版权所有 © Springer Science+Business Media, LLC, part of Springer Nature, 2018