The following pages link to Computing a Glimpse of Randomness (Q5472034):
Displaying 7 items.
- Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega (Q736609) (← links)
- Nonnormality of Stoneham constants (Q1927649) (← links)
- Searching for shortest and least programs (Q2286740) (← links)
- INDUCTIVE COMPLEXITY MEASURES FOR MATHEMATICAL PROBLEMS (Q2856020) (← links)
- A Program-Size Complexity Measure for Mathematical Problems and Conjectures (Q2891304) (← links)
- Computer Runtimes and the Length of Proofs (Q2891314) (← links)
- The complexity of the four colour theorem (Q3092009) (← links)
