The following pages link to André Nies (Q218973):
Displaying 50 items.
- COMPUTING<i>K</i>-TRIVIAL SETS BY INCOMPLETE RANDOM SETS (Q2925324) (← links)
- COMPLEXITY OF EQUIVALENCE RELATIONS AND PREORDERS FROM COMPUTABILITY THEORY (Q2933680) (← links)
- Differentiability of polynomial time computable functions (Q2965520) (← links)
- Lowness, Randomness, and Computable Analysis (Q2970988) (← links)
- An Analogy between Cardinal Characteristics and Highness Properties of Oracles (Q2989961) (← links)
- Borel structures and Borel theories (Q3011115) (← links)
- Separating Classes of Groups by First-Order Sentences (Q3043615) (← links)
- Benign cost functions and lowness properties (Q3083140) (← links)
- (Q3096589) (← links)
- (Q3113710) (← links)
- Definability in the Recursively Enumerable Degrees (Q3128481) (← links)
- A Computational Approach to the Borwein-Ditor Theorem (Q3188245) (← links)
- Lightface $$\mathop {\varPi }\nolimits _{3}^{0}$$ Π 3 0 -Completeness of Density Sets Under Effective Wadge Reducibility (Q3188261) (← links)
- Local Compactness for Computable Polish Metric Spaces is $$\varPi ^1_1$$-complete (Q3195707) (← links)
- (Q3224092) (← links)
- Closure of resource-bounded randomness notions under polynomial time permutations (Q3304150) (← links)
- RELATIVIZING CHAITIN'S HALTING PROBABILITY (Q3379458) (← links)
- Lowness and nullsets (Q3410688) (← links)
- Randomness and Computability: Open Questions (Q3412462) (← links)
- Calibrating Randomness (Q3412463) (← links)
- Non-cupping and randomness (Q3420057) (← links)
- Randomness and differentiability (Q3448999) (← links)
- (Q3464659) (← links)
- Counting the changes of random Δ20 sets (Q3465047) (← links)
- (Q3530393) (← links)
- (Q3530400) (← links)
- (Q3530401) (← links)
- Universal Recursively Enumerable Sets of Strings (Q3533008) (← links)
- Describing Groups (Q3533517) (← links)
- The First Order Theories of the Medvedev and Muchnik Lattices (Q3576064) (← links)
- Counting the Changes of Random ${\Delta^0_2}$ Sets (Q3576202) (← links)
- (Q3611832) (← links)
- Indifferent Sets (Q3623226) (← links)
- Superhighness and Strong Jump Traceability (Q3638076) (← links)
- Interpretability and Definability in the Recursively Enumerable Degrees (Q3839947) (← links)
- The theory of the recursively enumerable weak truth-table degrees is undecidable (Q4032867) (← links)
- The $\Pi _3$-theory of the computably enumerable Turing degrees is undecidable (Q4211072) (← links)
- (Q4282612) (← links)
- (Q4285797) (← links)
- Recursively Enumerable Equivalence Relations Modulo Finite Differences (Q4315325) (← links)
- Initial segments of the lattice of Π<sub>1</sub><sup>0</sup> classes (Q4328831) (← links)
- (Q4348130) (← links)
- Intervals of the Lattice of Computably Enumerable Sets and Effective Boolean Algebras (Q4354181) (← links)
- (Q4381411) (← links)
- PARAMETER DEFINABILITY IN THE RECURSIVELY ENUMERABLE DEGREES (Q4408481) (← links)
- (Q4428701) (← links)
- Global properties of the lattice of $\Pi ^0_1$ classes (Q4429726) (← links)
- (Q4460833) (← links)
- Effectively dense Boolean algebras and their applications (Q4505908) (← links)
- Model theory of the computably enumerable many-one degrees (Q4511663) (← links)
