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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
I. Kapovich, A. Myasnikov, P. Schupp, and V. Shpilrain, “Generic-case complexity, decision problems in group theory, and random walks,” J. Alg., 264, No. 2, 665-694 (2003).
I. Kapovich, A. Myasnikov, P. Schupp, and V. Shpilrain, “Average-case complexity and decision problems in group theory,” Adv. Math., 190, No. 2, 343-359 (2005).
J. D. Hamkins and A. Miasnikov, “The halting problem is decidable on a set of asymptotic probability one,” Notre Dame J. Form. Log., 47, No. 4, 515-524 (2006).
A. G. Myasnikov and A. N. Rybalov, “Generic complexity of undecidable problems,” J. Symb. Log., 73, No. 2, 656-673 (2008).
A. Rybalov, “On the strongly generic undecidability of the halting problem,” Theor. Comput. Sci., 377, Nos. 1-3, 268-270 (2007).
A. N. Rybalov, “On generic undecidability of the halting problem for normalized Turing machines,” Vestnik Omsk Univ., No. 3 (2014), pp. 15-17.
A. N. Rybalov, “Generic complexity of Presburger arithmetic,” Theor. Comput. Syst., 46, No. 1, 2-8 (2010).
A. Rybalov, “Generic complexity of the Diophantine problem,” Groups Complex. Cryptol., 5, No. 1, 25-30 (2013).
A. N. Rybalov, “Generic undecidability of existential theory of integer numbers ring,” Sib. El. Mat. Izv., 13, 882-887 (2016).
A. N. Rybalov, “On generic complexity of the problem of satisfiability of Boolean formulas,” Vestnik Omsk Univ., No. 4, pp. 52-56 (2013).
A. N. Rybalov, “On generic complexity of the quadratic residuosity problem,” Prikl. Diskr. Mat., No. 2(28), pp. 54-58 (2015).
A. N. Rybalov, “On generic complexity of the discrete logarithm problem,” Prikl. Diskr. Mat., No. 3(33), pp. 93-97 (2016).
A. Rybalov, “On the generic complexity of the searching graph isomorphism problem,” Groups Complex. Cryptol., 7, No. 2, 191-193 (2015).
C. G. Jockusch, Jr., and P. E. Schupp, “Generic computability, Turing degrees, and asymptotic density,” J. London Math. Soc., II. Ser., 85, No. 2, 472-490 (2012).
Author information
Authors and Affiliations
Corresponding author
Additional information
Supported by Russian Science Foundation, project No. 18-71-10028.
Translated from Algebra i Logika, Vol. 57, No. 4, pp. 448-455, July-August, 2018.
Rights and permissions
About this article
Cite this article
Rybalov, A.N. Generic Amplification of Recursively Enumerable Sets. Algebra Logic 57, 289–294 (2018). https://doi.org/10.1007/s10469-018-9500-y
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10469-018-9500-y