The following pages link to Liang Yu (Q409317):
Displaying 50 items.
- Finite state incompressible infinite sequences (Q259039) (← links)
- Fragments of Kripke-Platek set theory and the metamathematics of \(\alpha \)-recursion theory (Q334991) (← links)
- Lower bounds on the redundancy in computations from random oracles via betting strategies with restricted wagers (Q342726) (← links)
- Strict process machine complexity (Q403400) (← links)
- Characterizing strong randomness via Martin-Löf randomness (Q409318) (← links)
- Characterizing the strongly jump-traceable sets via randomness (Q456804) (← links)
- Universal recursively enumerable sets of strings (Q533863) (← links)
- Van Lambalgen's theorem and high degrees (Q540405) (← links)
- There are no maximal low d.c.e. degrees (Q558429) (← links)
- Extracting information is hard: a Turing degree of non-integral effective Hausdorff dimension (Q610681) (← links)
- Algorithmic randomness and monotone complexity on product space (Q627131) (← links)
- Oscillation in the initial segment complexity of random reals (Q633597) (← links)
- Higher Kurtz randomness (Q636362) (← links)
- Maximal pairs of c.e. reals in the computably Lipschitz degrees (Q638499) (← links)
- Demuth randomness and computational complexity (Q639659) (← links)
- Fixed points for the jump operator (Q694226) (← links)
- Representation of left-computable \(\varepsilon \)-random reals (Q716316) (← links)
- Lowness for genericity (Q818521) (← links)
- An extension of Harrington's noncupping theorem (Q866020) (← links)
- Lowness of higher randomness notions (Q948873) (← links)
- Effective packing dimension and traceability (Q985010) (← links)
- Superhighness (Q987937) (← links)
- Bounded Turing reductions and data processing inequalities for sequences (Q1787951) (← links)
- The Kolmogorov complexity of random reals (Q1887661) (← links)
- Infimum properties differ in the weak truth-table degrees and the Turing degrees (Q1888712) (← links)
- Compressibility and Kolmogorov complexity (Q1934957) (← links)
- Antibasis theorems for \({\Pi^0_1}\) classes and the jump hierarchy (Q1935363) (← links)
- Highness properties close to PA completeness (Q2055279) (← links)
- TD implies \(\operatorname{CC}_{\mathbb{R}} \) (Q2237378) (← links)
- Recursion theory. Computational aspects of definability (Q2260474) (← links)
- Searching for shortest and least programs (Q2286740) (← links)
- A reducibility related to being hyperimmune-free (Q2349101) (← links)
- Polynomial clone reducibility (Q2436621) (← links)
- Arithmetical Sacks forcing (Q2505505) (← links)
- Randomness and uniform distribution modulo one (Q2672239) (← links)
- RANDOMNESS IN THE HIGHER SETTING (Q2795912) (← links)
- Measure-theoretic applications of higher Demuth’s Theorem (Q2821688) (← links)
- On the Reals Which Cannot Be Random (Q2970982) (← links)
- Degree Spectra of Equivalence Relations (Q2989973) (← links)
- Descriptive set theoretical complexity of randomness notions (Q3100576) (← links)
- A New Proof of Friedman's Conjecture (Q3174641) (← links)
- On the definable ideal generated by nonbounding c.e. degrees (Q3370764) (← links)
- AN APPLICATION OF RECURSION THEORY TO ANALYSIS (Q3386607) (← links)
- Bounding non-GL<sub>2</sub> and R.E.A. (Q3399188) (← links)
- Measure theory aspects of locally countable orderings (Q3410682) (← links)
- Lowness and nullsets (Q3410688) (← links)
- On Σ<sub>1</sub>-Structural Differences Among Finite Levels of the Ershov Hierarchy (Q3416112) (← links)
- When van Lambalgen’s Theorem fails (Q3420060) (← links)
- On initial segment complexity and degrees of randomness (Q3506714) (← links)
- (Q3567853) (← links)
