The following pages link to S. Barry Cooper (Q242614):
Displayed 50 items.
- The machine as data: a computational view of emergence and definability (Q514566) (← links)
- Weak density and cupping in the d-r.e. degrees (Q582288) (← links)
- Extending and interpreting Post's programme (Q636317) (← links)
- (Q705535) (redirect page) (← links)
- The minimal e-degree problem in fragments of Peano arithmetic (Q705537) (← links)
- Computation and logic in the real world: CiE 2007 (Q733735) (← links)
- On Lachlan's major sub-degree problem (Q943340) (← links)
- Emergence as a computability-theoretic phenomenon (Q1036528) (← links)
- Complementing below recursively enumerable degrees (Q1093627) (← links)
- The density of the low\(_ 2\) \(n\)-r.e. degrees (Q1179531) (← links)
- The d.r.e. degrees are not dense (Q1182487) (← links)
- Initial segments of recursive linear orders (Q1267600) (← links)
- On the distribution of Lachlan nonsplitting bases (Q1407550) (← links)
- Non-uniformity and generalised Sacks splitting (Q1862888) (← links)
- The discontinuity of splitting in the recursively enumerable degrees (Q1902338) (← links)
- Upper cones as automorphism bases (Q1975834) (← links)
- There exists a maximal 3-c.e. enumeration degree (Q2382237) (← links)
- Corrigendum to: ``The d.r.e. degrees are not dense'' (Q2407276) (← links)
- Splitting and nonsplitting in the \(\Sigma_2^0\) enumeration degrees (Q2430010) (← links)
- Definability as hypercomputational effect (Q2497876) (← links)
- Splitting and cone avoidance in the d.c.e. degrees (Q2503830) (← links)
- On a Conjecture of Kleene and Post (Q2707068) (← links)
- (Q2851819) (← links)
- Mathematics, Metaphysics and the Multiverse (Q2891317) (← links)
- From Turing Machine to Morphogenesis: Forming and Informing Computation (Q2898013) (← links)
- Definability in the Real Universe (Q2906565) (← links)
- Introduction: computability of the physical (Q2919936) (← links)
- Automorphisms of<i>η</i>-like computable linear orderings and Kierstead's conjecture (Q2958211) (← links)
- Noncappable enumeration degrees below <b>0</b><sub><i>e</i></sub><sup>′</sup> (Q3128477) (← links)
- (Q3224114) (← links)
- A jump class of noncappable degrees (Q3481687) (← links)
- (Q3487329) (← links)
- The jump is definable in the structure of the degrees of unsolvability (Q3491536) (← links)
- Total Degrees and Nonsplitting Properties of $\Sigma_2^0$ Enumeration Degrees (Q3502679) (← links)
- The Non-isolating Degrees Are Upwards Dense in the Computably Enumerable Degrees (Q3502682) (← links)
- How enumeration reductibility yields extended Harrington non-splitting (Q3503759) (← links)
- The Extended Turing Model as Contextual Tool (Q3630186) (← links)
- Partial degrees and the density problem. Part 2: The enumeration degrees of the <i>Σ</i><sub>2</sub> sets are dense (Q3691654) (← links)
- Enumeration Reducibility Using Bounded Information: Counting Minimal Covers (Q3789543) (← links)
- Properly Σ2 Enumeration Degrees (Q3819056) (← links)
- A Splitting Theorem for the N-R.E. Degrees (Q3993783) (← links)
- Minimal pairs and high recursively enumerable degrees (Q4067085) (← links)
- Minimal degrees and the jump operator (Q4067086) (← links)
- (Q4281250) (← links)
- (Q4325780) (← links)
- (Q4336988) (← links)
- (Q4348125) (← links)
- (Q4381408) (← links)
- Jump equivalence of the Δ<sub>2</sub><sup>0</sup> hyperimmune sets (Q4405150) (← links)
- (Q4417312) (← links)