On the strongly generic undecidability of the Halting Problem

Theoretical Computer Science

Volumn 377, Issue 1-3, 2007, Pages 268-270

  Rybalov, Alexander ^a  

^a OMSK STATE UNIVERSITY   (Russian Federation)

Author keywords

Generic complexity; Halting Problem

Indexed keywords

ASYMPTOTIC ANALYSIS; MATHEMATICAL MODELS; PROBABILITY; PROBLEM SOLVING; SET THEORY; TURING MACHINES;

ASYMPTOTIC PROBABILITY; GENERIC COMPLEXITY; HALTING PROBLEMS;

COMPUTER SCIENCE;

EID: 84984590257     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.02.010     Document Type: Article

References (4)

1. Borovik A.V., Myasnikov A.G., and Remeslennikov V.N. Multiplicative measures on free groups. Internat. J. Algebra Comput. 13 6 (2003) 705-731
2. Hamkins J.D., and Miasnikov A. The halting problem is decidable on a set of asymptotic probability one. Notre Dame J. Formal Logic 47 4 (2006) 515-524
3. Kapovich I., Myasnikov A., Schupp P., and Shpilrain V. Generic-case complexity, decision problems in group theory and random walks. J. Algebra 264 2 (2003) 665-694
4. Kapovich I., Myasnikov A., Schupp P., and Shpilrain V. Average-case complexity and decision problems in group theory. Adv. Math. 190 2 (2005) 343-359