The following pages link to Rodney G. Downey (Q247180):
Displaying 50 items.
- (Q207721) (redirect page) (← links)
- (Q494055) (redirect page) (← links)
- (Q1066889) (redirect page) (← links)
- Abelian \(p\)-groups and the halting problem (Q306578) (← links)
- Courcelle's theorem for triangulations (Q346450) (← links)
- Strong jump-traceability. II: \(K\)-triviality (Q375805) (← links)
- Fundamentals of parameterized complexity (Q383833) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- The complexity of computable categoricity (Q471691) (← links)
- Solovay functions and their applications in algorithmic randomness (Q494057) (← links)
- Generic Muchnik reducibility and presentations of fields (Q503243) (← links)
- Notes on computable analysis (Q519888) (← links)
- Kobayashi compressibility (Q528498) (← links)
- Euclidean functions of computable Euclidean domains (Q540403) (← links)
- Metric structures and probabilistic computation (Q541224) (← links)
- There are no maximal low d.c.e. degrees (Q558429) (← links)
- Sound, totally sound, and unsound recursive equivalence types (Q581397) (← links)
- Weak density and cupping in the d-r.e. degrees (Q582288) (← links)
- (Q585944) (redirect page) (← links)
- (Q590800) (redirect page) (← links)
- Computable ideals in \(I\)-algebras (Q619312) (← links)
- Presentations of the successor relation of computable linear ordering (Q619461) (← links)
- Oscillation in the initial segment complexity of random reals (Q633597) (← links)
- Binary subtrees with few labeled paths (Q654001) (← links)
- Fixed-parameter tractability and completeness II: On completeness for W[1] (Q673779) (← links)
- Advice classes of parametrized tractability (Q676315) (← links)
- Friedberg splittings of recursively enumerable sets (Q685058) (← links)
- Undecidability and 1-types in the recursively enumerable degrees (Q688787) (← links)
- Incomparable prime ideals of recursively enumerable degrees (Q688789) (← links)
- Lowness for bounded randomness (Q690469) (← links)
- Correction to ``Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures'' (Q749526) (← links)
- Minimal degrees recursive in 1-generic degrees (Q750429) (← links)
- Lattice nonembeddings and initial segments of the recursively enumerable degrees (Q757358) (← links)
- The Lindenbaum fixed point algebra is undecidable (Q810010) (← links)
- Online promise problems with online width metrics (Q859981) (← links)
- Undecidability of the structure of the Solovay degrees of c.e. reals (Q881596) (← links)
- Pairs of recursive structures (Q923075) (← links)
- Labelling systems and r.e. structures (Q923076) (← links)
- Constructions by transfinitely many workers (Q923078) (← links)
- The isomorphism problem for torsion-free abelian groups is analytic complete (Q952542) (← links)
- The upward closure of a perfect thin class (Q958485) (← links)
- Turing degrees of reals of positive effective packing dimension (Q975475) (← links)
- Parameterized approximation of dominating set problems (Q975529) (← links)
- Decidability and computability of certain torsion-free abelian groups (Q976537) (← links)
- Effective packing dimension and traceability (Q985010) (← links)
- Space complexity of abelian groups (Q1005925) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- Subsets of hypersimple sets (Q1066890) (← links)
- Undecidability of \(L(F_{\infty})\) and other lattices of r.e. substructures (Q1083446) (← links)
- Completely mitotic r. e. degrees (Q1092895) (← links)
- Intervals and sublattices of the r.e. weak truth table degrees. I: Density (Q1092896) (← links)
- Intervals and sublattices of the r.e. weak truth table degrees. II: Nonbounding (Q1092897) (← links)
