Generic complexity of undecidable problems

Journal of Symbolic Logic

Volumn 73, Issue 2, 2008, Pages 656-673

  Myasnikov, Alexei G ^a   Rybalov, Alexander N ^b  

^a MCGILL UNIVERSITY   (Canada)

^b SOBOLEV INSTITUTE OF MATHEMATICS   (Russian Federation)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84984549325     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2178/jsl/1208359065     Document Type: Article

References (18)

1. S. I. ADJAN and V. G. DURNEV, Decision problems for groups and semigroups, Russian Mathematical Surveys, vol. 55 (2000), no. 2, pp. 207-296.
2. A. BOROVIK, A. MYASNIKOV, and V. N. REMESLENNIKOV, Multiplicative measures on free groups, International Journal of Algebra and Compututation, vol. 13 (2003), no. 6, pp. 705-731.
3. _, Algorithmic stratification of the conjugacy problem in Miller's groups, International Journal of Algebra and Computation, to appear.
4. A. BOROVIK, A. MYASNIKOV, and V SHPILRAIN, Measuring sets in infinite groups, Computational and Statistical Group Theory, Contemporary Mathematics, vol. 298, 2002, pp. 21-42.
5. S. B. COOPER, Computability Ttheory, Chapman and Hall/CRC, 2003.
6. R. GILMAN, A. D. MIASNIKOV, A. G. MYASNIKOV, and A. USHAKOV, Generic complexity, preprint.
7. J. D. HAMKINS and A. D. MIASNIKOV, The halting problem is decidable on a set of asymptotic probability one, Notre Dame Journal of Formal Logic, vol. 47 (2006), no. 4, pp. 515-524.
8. I. KAPOVICH, A. MYASNIKOV, P. SCHUPP, and V. SHPILRAIN, Generic-case complexity and decision problems in group theory, Journal of Algebra, vol. 264 (2003), pp. 665-694.
9. _, Average-case complexity for the word and membership problems in group theory, Advances in Mathematics, vol. 190 (2005), no. 2, pp. 343-359.
10. D. E. KNUTH, The Art of Computer Programming. Vol. 3: Sorting and Searching, Addison-Wesley, 1998.
11. A. A. MARKOV, On the impossibility of certain algorithms in the theory of associative systems, Doklady Akademii Nauk SSSR, vol. 55 (1947), pp. 587-590.
12. Y. V. MATIYASEVICH, Simple examples of undecidable associative calculi, Doklady Akademii Nauk SSSR, vol. 173 (1967), pp. 1264-1266.
13. E. MENDELSON, Introduction to Mathematical Logic, Chapman and Hall/CRC, 1997.
14. A. MIASNIKOV, A. USHAKOV, and D. W. WON, Generic complexity of the word problem infinitely presented semigroups, 2006, preprint.
15. E. L. POST, Recursive unsolvability of a problem of Thue, this JOURNAL, vol. 12 (1947), no. I, pp. 1-11.
16. A. RYBALOV, On the strongly generic undecidability of the halting problem, Theoretical Computer Science, vol. 377 (2007), no. 1-3, pp. 268-270.
17. J. E. SAVAGE, The Complexity of Computing, John Wiley and Sons Inc., 1977.
18. G. S. TSEITIN, An associative system with undecidable equivalence problem, Reports of Mathematical Institute of Soviet Academy of Science, vol. 52 (1958), pp. 172-189.