Notre Dame Journal of Formal Logic · 2006 · 47 citations · 2 references
ComputingComputer ScienceMathematicsProbability TheoryTheory Of ComputationComputational ModelsFinite-state MachinesTuring MachinesAsymptotic PropertiesDecidabilityHalting ProblemTuring Machine ComputabilityTuring Machine ModelUndecidability
The halting problem for Turing machines is decidable on a set of asymptotic probability one. The proof is sensitive to the particular\ncomputational models.
2