What percentage of programs halt?
From MaRDI portal
Publication:3448787
Recommendations
Cites work
- scientific article; zbMATH DE number 1136091 (Why is no real title available?)
- scientific article; zbMATH DE number 1500663 (Why is no real title available?)
- ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS
- Algorithmic randomness and complexity.
- Approximations to the halting problem
- Asymptotic proportion of hard instances of the halting problem
- Computability and randomness
- Every 2-random real is Kolmogorov random
- Fundamentals of Computation Theory
- Limit complexities revisited
- Optimal enumerations and optimal gödel numberings
- Random semicomputable reals revisited
- Randomness and recursive enumerability
- The halting problem is decidable on a set of asymptotic probability one
- Universal recursively enumerable sets of strings
Cited in
(5)
This page was built for publication: What percentage of programs halt?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3448787)