The following pages link to (Q4520520):
Displaying 18 items.
- Covering the recursive sets (Q508828) (← links)
- Computing halting probabilities from other halting probabilities (Q729891) (← links)
- Optimal asymptotic bounds on the oracle use in computations from Chaitin's Omega (Q736609) (← links)
- Randomness and universal machines (Q864423) (← links)
- Strong Chang's conjecture and the tree property at \(\omega_{2}\) (Q898536) (← links)
- Chaitin \(\Omega\) numbers, Solovay machines, and Gödel incompleteness. (Q1607291) (← links)
- Presentations of computably enumerable reals. (Q1607305) (← links)
- Randomness and reducibility (Q1878680) (← links)
- Bi-immunity over different size alphabets (Q2243580) (← links)
- Things that can be made into themselves (Q2252527) (← links)
- Relativized depth (Q2686103) (← links)
- Phase Transition between Unidirectionality and Bidirectionality (Q2891313) (← links)
- A Note on the Differences of Computably Enumerable Reals (Q2970983) (← links)
- Algorithmic information theory and its statistical mechanical interpretation (Q3298318) (← links)
- Trivial Reals (Q4916182) (← links)
- An incomplete set of shortest descriptions (Q5388731) (← links)
- Recursively enumerable reals and Chaitin \(\Omega\) numbers (Q5941066) (← links)
- A characterization of c. e. random reals (Q5958278) (← links)
