Skip to Main content Skip to Navigation
Conference papers

What Percentage of Programs Halt?

Abstract : Fix an optimal Turing machine U and for each n consider the ratio ρ^U_n of the number of halting programs of length at most n by the total number of such programs. Does this quantity have a limit value? In this paper, we show that it is not the case, and further characterise the reals which can be the limsup of such a sequence ρUn. We also study, for a given optimal machine U, how hard it is to approximate the domain of U from the point of view of coarse and generic computability.
Complete list of metadata
Contributor : Alexander Shen Connect in order to contact the contributor
Submitted on : Thursday, February 25, 2016 - 2:51:51 PM
Last modification on : Friday, August 5, 2022 - 3:02:59 PM



Laurent Bienvenu, Damien Desfontaines, Alexander Shen. What Percentage of Programs Halt?. ICALP: International Colloquium on Automata, Languages and Programming, EATCS, Jul 2015, Kyoto, Japan. pp.219-230, ⟨10.1007/978-3-662-47672-7⟩. ⟨lirmm-01279151⟩



Record views