Asymptotic behavior and halting probability of Turing Machines

Details Asymptotic behavior and halting probability of Turing Machines Asymptotic behavior and halting probability of Turing Machines

2005-12-16

arxiv.org/abs/math/0512390v5

Chaos, Solitons & Fractals (2006)

Mathematics

History and Overview

Plain LaTeX, 8 pages. In press

Scientific paper

10.1016/j.chaos.2006.08.022

Through a straightforward Bayesian approach we show that under some general conditions a maximum running time, namely the number of discrete steps performed by a computer program during its execution, can be defined such that the probability that such a program will halt after that time is smaller than any arbitrary fixed value. Consistency with known results and consequences are also discussed.

Affiliated with

Also associated with

No associations

Rating

Asymptotic behavior and halting probability of Turing Machines 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 Asymptotic behavior and halting probability of Turing Machines, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asymptotic behavior and halting probability of Turing Machines will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-112350