Journal of Symbolic Logic
- J. Symbolic Logic
- Volume 73, Issue 2 (2008), 656-673.
Generic complexity of undecidable problems
In this paper we study generic complexity of undecidable problems. It turns out that some classical undecidable problems are, in fact, strongly undecidable, i.e., they are undecidable on every strongly generic subset of inputs. For instance, the classical Halting Problem is strongly undecidable. Moreover, we prove an analog of the Rice theorem for strongly undecidable problems, which provides plenty of examples of strongly undecidable problems. Then we show that there are natural super-undecidable problems, i.e., problem which are undecidable on every generic (not only strongly generic) subset of inputs. In particular, there are finitely presented semigroups with super-undecidable word problem. To construct strongly- and super-undecidable problems we introduce a method of generic amplification (an analog of the amplification in complexity theory). Finally, we construct absolutely undecidable problems, which stay undecidable on every non-negligible set of inputs. Their construction rests on generic immune sets.
J. Symbolic Logic Volume 73, Issue 2 (2008), 656-673.
First available in Project Euclid: 16 April 2008
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Myasnikov, Alexei G.; Rybalov, Alexander N. Generic complexity of undecidable problems. J. Symbolic Logic 73 (2008), no. 2, 656--673. doi:10.2178/jsl/1208359065. https://projecteuclid.org/euclid.jsl/1208359065.