Abstract
This is an extended abstract of my talk on generic complexity of undecidable problems. It turns out that some classical undecidable problems are, in fact, strongly undecidable, i.e., they are still undecidable on every strongly generic (i.e., ”very very large”) subset of inputs. For instance, the classical Halting Problem for Turing machines is strongly undecidable. Moreover, we prove an analog of the Rice’s theorem for strongly undecidable problems, which provides plenty of examples of strongly undecidable problems. On the other hand, it has been shown recently that many of these classical undecidable problems are easily decidable on some generic (i.e., ”very large”) subsets of inputs. Altogether, these results lead to an interesting hierarchy of undecidable problems with respect to the size of subsets of inputs where the problems are still undecidable - a frequency analysis of hardness.
We construct here some 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).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adjan, S.I., Durnev, V.G.: Decision problems for groups and semigroups. Russian Math. Surveys 55(2), 207–296 (2000)
Borovik, A., Myasnikov, A., Shpilrain, V.: Measuring sets in infinite groups. Computational and Statistical Group Theory. Amer. Math. Soc. Contemporary Math. 298, 21–42 (2002)
Borovik, A.V., Myasnikov, A.G., Remeslennikov, V.N.: Multiplicative measures on free groups. Internat. J. Algebra Comput. 13(6), 705–731 (2003)
Borovik, A.V., Myasnikov, A.G., Remeslennikov, V.N.: Algorithmic stratification of the conjugacy problem in Millers groups. International Journal of Algebra and Computation (to appear)
Borovik, A.V., Myasnikov, A.G., Remeslennikov, V.N.: The conjugacy problem in amalgamated products I: regular elements and black holes
Cooper, S.B.: Computability Theory. Chapman and Hall/CRC Mathematics (2003)
Gilman, R., Miasnikov, A.D., Myasnikov, A.G., Ushakov, A.: Generic Complexity (preprint)
Hamkins, J.D., Miasnikov, A.: The halting problem is decidable on a set of asymptotic probability one. Notre Dame Journal of Formal Logic 47(4), 515–524 (2006)
Kapovich, I., Myasnikov, A., Schupp, P., Shpilrain, V.: Generic-case complexity and decision problems in group theory. J. of Algebra 264, 665–694 (2003)
Kapovich, I., Myasnikov, A., Schupp, P., Shpilrain, V.: Average-case complexity for the word and membership problems in group theory. Advances in Mathematics 190(2), 343–359 (2005)
Knuth, D.E.: The art of computer programming: Sorting and Searching, vol. 3. Addison-Wesley, Reading (1998)
Markov, A.A.: On the impossibility of certain algorithms in the theory of associative systems, Dokl. Akad. Nauk SSSR 55, 587–590 (1947) (French transl., C.R. (Dokl.) Acad. Sci. URSS II, 55, 583–586 (1947))
Yu, V.: Matiyasevich, Simple examples of undecidable associative calculi, Dokl. Akad. Nauk SSSR 173, 1264–1266 (1967) (English transl., Soviet Math. Dokl. 8, 555–557 (1967))
Mendelson, E.: Introduction to Mathematical Logic. Chapman and Hall/CRC (1997)
Myasnikov, A., Ushakov, A.: Random van Kampen Diagrams and algorithmic problems in groups
Miasnikov, A., Ushakov, A., Won, D.W.: Generic complexity of the word problem in finitely presented semigroups 2006 (preprint)
Post, E.L.: Recursive unsolvability of a problem of Thue. J.Symbolic Logic 12(1), 1–11 (1947)
Rybalov, A.: On the Strongly Generic Undecidability of the Halting Problem. In: Theoretical Computer Science 2007 (to appear)
Savage, J.E.: The Complexity of Computing. John Wiley and Sons Inc., Chichester (1977)
Tseitin, G.S.: An associative system with undecidable equivalence problem. MIAN 52, 172–189 (1958)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Myasnikov, A. (2007). Generic Complexity of Undecidable Problems. In: Diekert, V., Volkov, M.V., Voronkov, A. (eds) Computer Science – Theory and Applications. CSR 2007. Lecture Notes in Computer Science, vol 4649. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74510-5_41
Download citation
DOI: https://doi.org/10.1007/978-3-540-74510-5_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74509-9
Online ISBN: 978-3-540-74510-5
eBook Packages: Computer ScienceComputer Science (R0)