Asymptotic behavior and halting probability of Turing Machines
| dc.creator | D'Abramo, Germano | |
| dc.date | 2005-12-16 | |
| dc.date | 2006-10-05 | |
| dc.date.accessioned | 2026-07-07T06:55:24Z | |
| dc.date.available | 2026-07-07T06:55:24Z | |
| dc.description | 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. | |
| dc.description | Plain LaTeX, 8 pages. In press | |
| dc.identifier | https://arxiv.org/abs/math/0512390 | |
| dc.identifier | http://arxiv.org/abs/math/0512390 | |
| dc.identifier | Chaos, Solitons & Fractals (2006) | |
| dc.identifier | doi:10.1016/j.chaos.2006.08.022 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/106269 | |
| dc.subject | History and Overview | |
| dc.title | Asymptotic behavior and halting probability of Turing Machines | |
| dc.type | text |