The following pages link to S. Barry Cooper (Q242614):
Displayed 29 items.
- (Q4449350) (← links)
- Splitting and nonsplitting, II: A low<sub>2</sub> c.e. degree above which <i>0</i>′ is not splittable (Q4451726) (← links)
- Turing Definability in the Ershov Hierarchy (Q4466450) (← links)
- (Q4511553) (← links)
- Properly ?2 minimal degrees and 0? complementation (Q4680373) (← links)
- Splitting and jump inversion in the Turing degrees (Q4683147) (← links)
- Linearisations and the Ershov hierarchy (Q4683149) (← links)
- The strong anticupping property for recursively enumerable degrees (Q4713085) (← links)
- On minimal pairs of enumeration degrees (Q4723719) (← links)
- Partial degrees and the density problem (Q4749831) (← links)
- (Q4863239) (← links)
- Strong Minimal Covers for Recursively Enumerable Degrees (Q4879197) (← links)
- The Mathematician’s Bias — and the Return to Embodied Computation (Q4907916) (← links)
- (Q4934279) (← links)
- (Q4938553) (← links)
- (Q4944907) (← links)
- Incomputability after Alan Turing (Q5410067) (← links)
- A Roadmap for TAMC (Q5410630) (← links)
- The Strongest Nonsplitting Theorem (Q5425433) (← links)
- Post's Programme for the Ershov Hierarchy (Q5441119) (← links)
- (Q5477947) (← links)
- Degrees of unsolvability complementary between recursively enumerable degrees, Part 1 (Q5661863) (← links)
- Minimal Upper Bounds for Sequences of Recursively Enumerable Degrees (Q5670616) (← links)
- New Computational Paradigms (Q5717023) (← links)
- Bounding and nonbounding minimal pairs in the enumeration degrees (Q5718686) (← links)
- SOFSEM 2006: Theory and Practice of Computer Science (Q5897970) (← links)
- Theory and Applications of Models of Computation (Q5898921) (← links)
- Cupping and noncupping in the enumeration degrees of \(\Sigma_ 2^ 0\) sets (Q5961497) (← links)
- The Incomputable Alan Turing (Q6233538) (← links)