On the strongly generic undecidability of the Halting Problem
暂无分享,去创建一个
It has been shown in [J.D. Hamkins, A. Miasnikov, The halting problem is decidable on a set of asymptotic probability one, Notre Dame J. Formal Logic 47(4) (2006) 515-524] that the classical Halting Problem for Turing machines with one-way tape is decidable on a ''large'' set of Turing machines (a so-called generic set). However, here we prove that the Halting Problem remains undecidable when restricted to an arbitrary ''very large'' set of Turing machines (a so-called strongly generic set). Our proof is independent of a Turing machine model.
[1] Ilya Kapovich,et al. Average-case complexity and decision problems in group theory , 2002, ArXiv.
[2] Joel David Hamkins,et al. The Halting Problem Is Decidable on a Set of Asymptotic Probability One , 2006, Notre Dame J. Formal Log..
[3] Alexandre V. Borovik,et al. Multiplicative Measures on Free Groups , 2002, Int. J. Algebra Comput..
[4] Ilya Kapovich,et al. Generic-case complexity, decision problems in group theory and random walks , 2002, ArXiv.