The following pages link to Randomness and universal machines (Q864423):
Displayed 11 items.
- Universal recursively enumerable sets of strings (Q533863) (← 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)
- \(\Pi_1^0 \) classes, LR degrees and Turing degrees (Q958483) (← links)
- Searching for shortest and least programs (Q2286740) (← links)
- Differences of halting probabilities (Q2402368) (← links)
- Random reals à la Chaitin with or without prefix-freeness (Q2456371) (← links)
- Lowness properties and approximations of the jump (Q2478546) (← links)
- Universality probability of a prefix-free machine (Q2941600) (← links)
- A Note on the Differences of Computably Enumerable Reals (Q2970983) (← links)
- An incomplete set of shortest descriptions (Q5388731) (← links)