The halting problem is decidable on a set of asymptotic probability one

Details The halting problem is decidable on a set of asymptotic probability one The halting problem is decidable on a set of asymptotic probability one

2005-04-18

arxiv.org/abs/math/0504351v1

Mathematics

Logic

10 pages

Scientific paper

The halting problem for Turing machines is decidable on a set of asymptotic probability one. Specifically, there is a set B of Turing machine programs such that (i) B has asymptotic probability one, so that as the number of states n increases, the proportion of all n-state programs that are in B goes to one; (ii) B is polynomial time decidable; and (iii) the halting problem H intersect B is polynomial time decidable. The proof is sensitive to the particular computational model.

Affiliated with

Also associated with

No associations

Rating

The halting problem is decidable on a set of asymptotic probability one does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The halting problem is decidable on a set of asymptotic probability one, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The halting problem is decidable on a set of asymptotic probability one will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-138077