What percentage of programs halt?
DOI10.1007/978-3-662-47672-7_18zbMATH Open1440.03057DBLPconf/icalp/BienvenuDS15OpenAlexW1044326647WikidataQ57349433 ScholiaQ57349433MaRDI QIDQ3448787FDOQ3448787
Authors: Laurent Bienvenu, Damien Desfontaines, A. Shen 
Publication date: 27 October 2015
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://zenodo.org/record/51938
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Algorithmic randomness and dimension (03D32) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Turing machines and related notions (03D10)
Cites Work
- Algorithmic randomness and complexity.
- Computability and randomness
- Every 2-random real is Kolmogorov random
- ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS
- Limit complexities revisited
- Randomness and recursive enumerability
- Random semicomputable reals revisited
- Universal recursively enumerable sets of strings
- Title not available (Why is that?)
- The halting problem is decidable on a set of asymptotic probability one
- Approximations to the halting problem
- Optimal enumerations and optimal gödel numberings
- Fundamentals of Computation Theory
- Asymptotic Proportion of Hard Instances of the Halting Problem
- Title not available (Why is that?)
Cited In (4)
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)
