The following pages link to (Q4381402):
Displaying 17 items.
- Simplicity via provability for universal prefix-free Turing machines (Q616504) (← links)
- A c.e. real that cannot be sw-computed by any \(\Omega\) number (Q867401) (← links)
- Chaitin \(\Omega\) numbers, Solovay machines, and Gödel incompleteness. (Q1607291) (← links)
- The closure properties on real numbers under limits and computable operators. (Q1607302) (← links)
- Presentations of computably enumerable reals. (Q1607305) (← links)
- Epistemic horizons and the foundations of quantum mechanics (Q1735885) (← links)
- Randomness and reducibility (Q1878680) (← links)
- On Kurtz randomness (Q1885902) (← links)
- The Kolmogorov complexity of random reals (Q1887661) (← links)
- Random reals à la Chaitin with or without prefix-freeness (Q2456371) (← links)
- Random Semicomputable Reals Revisited (Q2891300) (← links)
- What Percentage of Programs Halt? (Q3448787) (← links)
- Π11‐Martin‐Löf randomness and Π11‐Solovay completeness (Q5108862) (← links)
- Computing a Glimpse of Randomness (Q5472034) (← links)
- Weakly computable real numbers (Q5925970) (← links)
- Recursively enumerable reals and Chaitin \(\Omega\) numbers (Q5941066) (← links)
- A characterization of c. e. random reals (Q5958278) (← links)