The following pages link to George Barmpalias (Q342723):
Displaying 50 items.
- Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers (Q342726) (← links)
- Unperturbed Schelling segregation in two or three dimensions (Q343950) (← links)
- Randomness notions and partial relativization (Q375818) (← links)
- Universal computably enumerable sets and initial segment prefix-free complexity (Q391648) (← links)
- Kolmogorov complexity and computably enumerable sets (Q490655) (← links)
- Random numbers as probabilities of machine behavior (Q524278) (← links)
- Kobayashi compressibility (Q528498) (← links)
- Elementary differences between the degrees of unsolvability and degrees of compressibility (Q636334) (← links)
- Upper bounds on ideals in the computably enumerable Turing degrees (Q639654) (← links)
- On the number of infinite sequences with trivial initial segment complexity (Q655422) (← links)
- Kolmogorov complexity of initial segments of sequences and arithmetical definability (Q719306) (← 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)
- Tracing and domination in the Turing degrees (Q764269) (← links)
- Random non-cupping revisited (Q864434) (← links)
- The hypersimple-free c.e. wtt degrees are dense in the c.e. wtt degrees (Q866498) (← links)
- Randomness and the linear degrees of computability (Q866567) (← links)
- A c.e. real that cannot be sw-computed by any \(\Omega\) number (Q867401) (← links)
- Algorithmic randomness of continuous functions (Q926181) (← links)
- \(\Pi_1^0 \) classes, LR degrees and Turing degrees (Q958483) (← links)
- Relative randomness and cardinality (Q985004) (← links)
- Optimal redundancy in computations from random oracles (Q1678164) (← links)
- Minority population in the one-dimensional Schelling model of segregation (Q1756787) (← links)
- Approximation representations for \(\Delta_2\) reals (Q1762732) (← links)
- Equivalences between learning of data and probability distributions, and their applications (Q1784951) (← links)
- (Q1941711) (redirect page) (← links)
- Analogues of Chaitin's Omega in the computably enumerable sets (Q1941714) (← links)
- On the gap between trivial and nontrivial initial segment prefix-free complexity (Q1946508) (← links)
- Randomness below complete theories of arithmetic (Q2112795) (← links)
- Granularity of wagers in games and the possibility of saving (Q2216114) (← links)
- Monotonous betting strategies in warped casinos (Q2304524) (← links)
- Tipping points in 1-dimensional Schelling models with switching agents (Q2342077) (← links)
- Integer valued betting strategies and Turing degrees (Q2353410) (← links)
- Differences of halting probabilities (Q2402368) (← links)
- The ibT degrees of computably enumerable sets are not dense (Q2498899) (← links)
- Hypersimplicity and semicomputability in the weak truth table degrees (Q2576639) (← links)
- The Kučera-Gács theorem revisited by Levin (Q2682931) (← links)
- Measure and cupping in the Turing degrees (Q2845877) (← links)
- Algorithmic randomness and measures of complexity (Q2870106) (← links)
- The typical Turing degree (Q2874662) (← links)
- Compactness arguments with effectively closed sets for the study of relative randomness (Q2907048) (← links)
- Low upper bounds in the Turing degrees revisited (Q2907049) (← links)
- EXACT PAIRS FOR THE IDEAL OF THE<i>K</i>-TRIVIAL SEQUENCES IN THE TURING DEGREES (Q2933669) (← links)
- Universality probability of a prefix-free machine (Q2941600) (← links)
- A Note on the Differences of Computably Enumerable Reals (Q2970983) (← links)
- Jump inversions inside effectively closed sets and applications to randomness (Q3011117) (← links)
- Chaitin's halting probability and the compression of strings using oracles (Q3092881) (← links)
- Approximation representations for reals and their wtt‐degrees (Q3159422) (← links)
- Random reals and Lipschitz continuity (Q3422017) (← links)
- Randomness, lowness and degrees (Q3503755) (← links)
