The following pages link to André Nies (Q218973):
Displaying 50 items.
- Coherent randomness tests and computing the \(K\)-trivial sets (Q277530) (← links)
- Randomness notions and partial relativization (Q375818) (← links)
- Computably enumerable sets below random sets (Q450954) (← links)
- Characterizing the strongly jump-traceable sets via randomness (Q456804) (← links)
- Solovay functions and their applications in algorithmic randomness (Q494057) (← links)
- Universal recursively enumerable sets of strings (Q533863) (← links)
- Program size complexity for possibly infinite computations (Q558440) (← links)
- Finite automata presentable Abelian groups (Q636284) (← links)
- Higher Kurtz randomness (Q636362) (← links)
- Upper bounds on ideals in the computably enumerable Turing degrees (Q639654) (← links)
- Demuth randomness and computational complexity (Q639659) (← links)
- A new spectrum of recursive models (Q701304) (← links)
- FA-presentable groups and rings (Q947484) (← links)
- Lowness of higher randomness notions (Q948873) (← links)
- Superhighness (Q987937) (← links)
- Branching in the enumeration degrees of the \(\Sigma_2^0\) sets (Q1293973) (← links)
- Cappable recursively enumerable degrees and Post's program (Q1311427) (← links)
- Coding in the partial order of enumerable sets (Q1380333) (← links)
- (Q1381431) (redirect page) (← links)
- Computable models of theories with few models (Q1381432) (← links)
- Undecidability results for low complexity time classes (Q1567411) (← links)
- From eventually different functions to pandemic numberings (Q1670726) (← links)
- Describing finite groups by short first-order sentences (Q1678638) (← links)
- Aspects of free groups. (Q1810546) (← links)
- Interpreting \(\mathbb{N}\) in the computably enumerable weak truth table degrees (Q1840456) (← links)
- Interpreting true arithmetic in the theory of the r.e. truth table degrees (Q1902619) (← links)
- Undecidable fragments of elementary theories (Q1906521) (← links)
- The last question on recursively enumerable \(m\)-degrees (Q1908450) (← links)
- Atomless \(r\)-maximal sets (Q1961349) (← links)
- Highness properties close to PA completeness (Q2055279) (← links)
- Randomness and initial segment complexity for measures (Q2062126) (← links)
- Computable topological abelian groups (Q2099260) (← links)
- Universality for left-computably enumerable metric spaces (Q2263106) (← links)
- Martin-Löf randomness implies multiple recurrence in effectively closed sets (Q2330508) (← links)
- Feasible analysis, randomness, and base invariance (Q2354578) (← links)
- Metric Scott analysis (Q2401685) (← links)
- A universal separable diversity (Q2412991) (← links)
- Lowness properties and approximations of the jump (Q2478546) (← links)
- Lowness properties and randomness (Q2570074) (← links)
- Kolmogorov-Loveland randomness and stochasticity (Q2576945) (← links)
- (Q2762505) (← links)
- Randomness, Computability, and Density (Q2784497) (← links)
- DEMUTH’S PATH TO RANDOMNESS (Q2795307) (← links)
- $K$-triviality in computable metric spaces (Q2839373) (← links)
- Denjoy, Demuth and density (Q2878781) (← links)
- Demuth’s Path to Randomness (Q2891309) (← links)
- (Q2904792) (← links)
- Low upper bounds in the Turing degrees revisited (Q2907049) (← links)
- Equivalence Relations That Are $\Sigma^0_3$ Complete for Computable Reducibility (Q2915014) (← links)
- CHARACTERIZING LOWNESS FOR DEMUTH RANDOMNESS (Q2921009) (← links)
