The following pages link to André Nies (Q218973):
Displaying 50 items.
- (Q4513973) (← links)
- (Q4520520) (← links)
- Differences of Computably Enumerable Sets (Q4521130) (← links)
- A Unifying Approach to the Gamma Question (Q4635838) (← links)
- Randomness and Solovay degrees (Q4638260) (← links)
- Effectively closed subgroups of the infinite symmetric group (Q4691363) (← links)
- THE COMPLEXITY OF TOPOLOGICAL GROUP ISOMORPHISM (Q4692086) (← links)
- The ∀∃-theory of ℛ(≤,∨,∧) is undecidable (Q4813796) (← links)
- (Q4863247) (← links)
- The undecidability of the Π<sub>4</sub>-theory for the r.e. wtt and Turing degrees (Q4876314) (← links)
- Trivial Reals (Q4916182) (← links)
- Lowness Properties of Reals and Hyper-Immunity (Q4924529) (← links)
- Structural properties and Σ<sub>2</sub><sup>0</sup> enumeration degrees (Q4953220) (← links)
- The Complexity of Recursive Splittings of Random Sets (Q4979763) (← links)
- Algorithmic Aspects of Lipschitz Functions (Q4979765) (← links)
- FRAÏSSÉ LIMITS FOR RELATIONAL METRIC STRUCTURES (Q5015719) (← links)
- THE REVERSE MATHEMATICS OF THEOREMS OF JORDAN AND LEBESGUE (Q5021932) (← links)
- Coarse groups, and the isomorphism problem for oligomorphic groups (Q5081950) (← links)
- The theory of the polynomial many-one degrees of recursive sets is undecidable (Q5096783) (← links)
- RANDOMNESS NOTIONS AND REVERSE MATHEMATICS (Q5107230) (← links)
- Computing from projections of random points (Q5114804) (← links)
- MUCHNIK DEGREES AND CARDINAL CHARACTERISTICS (Q5159485) (← links)
- Martin-Löf random quantum states (Q5235513) (← links)
- Comparing quasi-finitely axiomatizable and prime groups (Q5292700) (← links)
- Randomness via effective descriptive set theory (Q5294149) (← links)
- Using random sets as oracles (Q5308172) (← links)
- Automatic Structures: Richness and Limitations (Q5310687) (← links)
- The Classification Problem for Compact Computable Metric Spaces (Q5326380) (← links)
- USING ALMOST-EVERYWHERE THEOREMS FROM ANALYSIS TO STUDY RANDOMNESS (Q5346702) (← links)
- Computability and Randomness (Q5389159) (← links)
- Joining non-low C.E. sets with diagonally non-computable functions (Q5406113) (← links)
- A Weakly 2-Random Set That Is Not Generalized Low (Q5425349) (← links)
- Finite Automata Presentable Abelian Groups (Q5434523) (← links)
- Lowness for the Class of Schnorr Random Reals (Q5470706) (← links)
- (Q5494235) (← links)
- STACS 2005 (Q5710695) (← links)
- Randomness, relativization and Turing degrees (Q5718673) (← links)
- Calibrating the complexity of $\Delta^{0}_{2}$ sets via their changes (Q5737997) (← links)
- (Q5874332) (← links)
- On the filter of computably enumerable supersets of an r-maximal set (Q5950713) (← links)
- Word automatic groups of nilpotency class 2 (Q6072210) (← links)
- MAXIMAL TOWERS AND ULTRAFILTER BASES IN COMPUTABILITY THEORY (Q6095978) (← links)
- Logic Blog 2016 (Q6283905) (← links)
- The reverse mathematics of theorems of Jordan and Lebesgue (Q6285139) (← links)
- Fra\"iss\'e Limits for Relational Metric Structures (Q6312134) (← links)
- Randomness and initial segment complexity for probability measures (Q6314388) (← links)
- From eventually different functions to pandemic numberings (Q6334068) (← links)
- Computable topological abelian groups (Q6368661) (← links)
- Logic Blog 2022 (Q6427370) (← links)
- Martin-Löf reducibility and cost functions (Q6561664) (← links)
